Abstract
AbstractThis 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.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference39 articles.
1. Hopcroft, J. E. , Motwani, R. and Ullman, J. D. (2003). Introduction to Automata Theory, Languages, and Computation, int. ed. 2nd ed., Addison-Wesley.
2. Probabilistic finite-state machines - part I
3. Kleene algebra with tests
4. A semantics and a logic for Fuzzy Arden Syntax
5. McIver, A. , Cohen, E. and Morgan, C. (2006). Using probabilistic kleene algebra for protocol verification. In: Schmidt, R. A. (ed.) Relations and Kleene Algebra in Computer Science, 9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra, RelMiCS/AKA 2006, Manchester, UK, August 29–September 2, 2006, Proceedings, Lecture Notes in Computer Science, vol. 4136, Springer, 296–310.