Some remarks on multiple-entry finite automata
Paulo A. S. Veloso,Arthur Gill +1 more
Reads0
Chats0
TLDR
The effects of nondeterminism and of other logics on the family of languages accepted, comparison with finite automata in terms of number of states and a bound on a decision procedure are presented.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1979-06-01 and is currently open access. It has received 20 citations till now. The article focuses on the topics: Quantum finite automata & Automata theory.read more
Citations
More filters
Journal Article
Descriptional Complexity of Machines with Limited Resources.
Jonathan Goldstine,Martin Kappes,Chandra M. R. Kintala,Hing Leung,Andreas Malcher,Detlef Wotschke +5 more
TL;DR: The goal here is to provide a survey of results on descriptional complexity of machines with limited resources for various types of finite state machines, pushdown automata, parsers and cellu- lar automata and on the effect it has on theirdescriptional complexity.
Journal ArticleDOI
Descriptional complexity of nfa of different ambiguity
TL;DR: A family of regular languages is presented that is conjecture to be a good candidate for separating FNA from LNA (linearly ambiguous NFA), and new results are given for separating DFA from UFA (unambiguous finite automata), UFA from MDFA (DFA with multiple initial states) and UFAFrom FNA (finitely ambiguous N FA).
Book ChapterDOI
Syntactic complexity of ideal and closed languages
Janusz A. Brzozowski,Yuli Ye +1 more
TL;DR: In this article, it was shown that nn-1 is a tight upper bound on the complexity of right ideals and prefix-closed regular languages, and that there exist left ideals and suffix-closed languages of syntactic complexity n n-1 + n - 1, and two-sided ideals and factor-closeness of syntactically complex regular languages with state complexity nn -2 + (n - 2)2n-2 + 1.
Posted Content
On NFAs Where All States are Final, Initial, or Both
TL;DR: In this article, the hardness results for nonuniversality and inequivalence problems for finite automata with all states being final, initial, or both initial and final are presented.
Posted Content
Syntactic Complexity of Ideal and Closed Languages
Janusz A. Brzozowski,Yuli Ye +1 more
TL;DR: It is proved that nn-1 is a tight upper bound on the complexity of right ideals and prefix-closed languages, and that there exist left ideals and suffix- closed languages of syntactic complexity nn -1 + n - 1, and two-sided ideals and factor-closed Languages of syntactical complexity n n-2 + (n - 2)2n-2 - 1.
References
More filters
Journal ArticleDOI
Multiple-entry finite automata
Arthur Gill,Lawrence T. Kou +1 more
TL;DR: This paper study properties of mefa's and formulate a necessary and sufficient condition for regular sets to be mefa-recognizable and develop algorithms for testing for this condition and for constructing the recognizing mefa whenever this conditions is satisfied.
Journal ArticleDOI
Ultimate-Definite and Symmetric-Definite Events and Automata
A. Paz,Bezalel Peleg +1 more
TL;DR: Effective decision procedures whereby it can be decided whether a given finite automata defines such an event are given are given and unique canonical representations for these events are derived.
Journal ArticleDOI
A note on multiple-entry finite automata
Zvi Galil,Janos Simon +1 more
TL;DR: The Gill and Kou introduced the multiple-entry finite automaton (mefa) with no specified initial state and showed that the class of languages accepted by mefa's is theclass of regular languages closed under suffix, and tried to show that mefa descriptions may be very economical by exhibiting a mefa with n states such that every equivalent dfa has at least 2 n states.