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

Characterization of state-independent automata

โœ Scribed by Jerzy W. Grzymala-Busse; Zamir Bavel


Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
578 KB
Volume
43
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Characterization of Glushkov automata
โœ Pascal Caron; Djelloul Ziadi ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 218 KB
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

cover
โœ Brown, Sherry L. ๐Ÿ“‚ Fiction ๐Ÿ“… 2019 ๐ŸŒ English โš– 98 KB ๐Ÿ‘ 2 views
cover
โœ Brown, Sherry L ๐Ÿ“‚ Fiction ๐Ÿ“… 2019 ๐ŸŒ English โš– 98 KB ๐Ÿ‘ 2 views
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.