On the descriptional complexity of the window size for deterministic restarting automata

Authors:
Martin Kutrib;Friedrich Otto
Affiliations:
Institut für Informatik, Universität Giessen, Giessen, Germany;Fachbereich Elektrotechnik/Informatik, Universität Kassel, Kassel, Germany
Venue:
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Year:
2012

Citing 9
Cited 0

Regularity and Related Problems for Deterministic Pushdown Automata

Journal of the ACM (JACM)
On monotonic automata with a restart operation

Journal of Automata, Languages and Combinatorics
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)
Restarting Automata

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Succinct description of regular languages by weak restarting automata

Information and Computation
Economy of description by automata, grammars, and formal systems

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Non-recursive trade-offs for deterministic restarting automata

Journal of Automata, Languages and Combinatorics
On stateless deterministic restarting automata

Acta Informatica
Restarting automata with auxiliary symbols and small lookahead

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the descriptional complexity of restarting automata, an automaton model inspired from linguistics. More precisely, we study the impact of the window size. For window sizes of at least two, it is shown that between any two levels of the RW- and RRW-automata hierarchy, there are savings in the economy of description of the automata which cannot be bounded by any recursive function. This is true even if the automata are deterministic and/or stateless. The trade-off between window sizes two and one is recursive for deterministic devices. In addition, we establish polynomial upper bounds for the trade-offs between RRWW-automata with window sizes k+1 and k for all k≥2.