Characterization of Glushkov automata
โ Scribed by Pascal Caron; Djelloul Ziadi
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 218 KB
- Volume
- 233
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we establish some important concepts in fuzzy รฟnite automata (FFAs) with bifuzzy property, and clarify their essential relationships. First we present a number of basic deรฟnitions and properties in FFAs. We then deรฟne a bifuzzy family of subautomata, bifuzzy source and successor opera
We show that a language of infinite binary trees is definable by a ฮฃ 2 -formula of the monadic second order logic of two successors (with no additional symbols) iff it can be accepted by a Bรผchi automaton. The same result has been obtained by G. Lenzi, but our proof is simpler.