No CrossRef data available.
Article contents
Weighted synchronous automata
Published online by Cambridge University Press: 25 January 2023
Abstract
This paper introduces a class of automata and associated languages, suitable to model a computational paradigm of fuzzy systems, in which both vagueness and simultaneity are taken as first-class citizens. This requires a weighted semantics for transitions and a precise notion of a synchronous product to enforce the simultaneous occurrence of actions. The usual relationships between automata and languages are revisited in this setting, including a specific Kleene theorem.
- Type
- Special Issue: LSFA’19 and LSFA’20
- Information
- Mathematical Structures in Computer Science , Volume 32 , Special Issue 9: LSFA 2019 and 2020 , October 2022 , pp. 1234 - 1253
- Copyright
- © The Author(s), 2023. Published by Cambridge University Press
Footnotes
This work is financed by the FCT – Fundação para a Ciência e a Tecnologia, I.P. (Portuguese Foundation for Science and Technology) within the project IBEX, with reference PTDC/CCI-COM/4280/2021 and project UIDB/04106/2020.