Intersection and union of regular languages and state complexity
Information Processing Letters
Partial orders on words, minimal elements of regular languages, and state complexity
Theoretical Computer Science
SIAM Journal on Computing
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
NFA to DFA transformation for finite languages over arbitrary alphabets
Journal of Automata, Languages and Combinatorics
On monotonic automata with a restart operation
Journal of Automata, Languages and Combinatorics
On the size of parsers and LR(k)-grammars
Theoretical Computer Science
Size/lookahead tradeoff for LL(k)-grammars
Information Processing Letters
Lookahead hierarchies of restarting automata
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
On Restarting Automata with Rewriting
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
On Stateless Deterministic Restarting Automata
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
On restarting automata with window size one
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Characterizing the rational functions by restarting transducers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On the descriptional complexity of the window size for deterministic restarting automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
The descriptional complexity of restarting automata is investigated. We distinguish the classes of weak restarting automata, i.e., classical restarting automata accepting exactly the regular languages. In order to investigate the descriptional power gained by the additional structural resources of restarting automata, we study the trade-offs in the number of states when changing the representation to classical finite automata. The bounds shown are tight in the exact number of states. Interestingly, for a particular class we can show the tight bounds 2^n+1 and 2^n for DFA and NFA conversion, respectively, by a fooling set technique. So, the power gained by the resources given to restarting automata seems to be different compared with nondeterminism.