๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Characterizations of fuzzy finite automa
โœ Daowen Qiu ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB

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

Recreating Glushkov's idea
โœ A. A. Popov ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Springer US ๐ŸŒ English โš– 171 KB
A characterization of Bรผchi tree automat
โœ Jerzy Skurczyล„ski ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 68 KB

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.

A problem of V. M. Glushkov
โœ B. A. Pogorelov ๐Ÿ“‚ Article ๐Ÿ“… 1975 ๐Ÿ› Springer US ๐ŸŒ English โš– 232 KB