Non-recursive trade-offs for deterministic restarting automata

Authors:
Markus Holzer;Martin Kutrib;Jens Reimann
Affiliations:
Institut für Informatik, Technische Universität München, München, Germany;Institut für Informatik, Universität Giessen, Giessen, Germany;Institut für Informatik, Universität Giessen, Giessen, Germany
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2007

Citing 10
Cited 3

Church-Rosser Thue systems and formal languages

Journal of the ACM (JACM)
Growing context-sensitive languages and Church-Rosser languages

Information and Computation
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)
On one-way auxiliary pushdown automata

Proceedings of the 3rd GI-Conference on Theoretical Computer Science
Restarting Automata

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Descriptional complexity of cellular automata and decidability questions

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On the descriptional power of heads, counters, and pebbles

Theoretical Computer Science - Descriptional complexity of formal systems
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages

Information and Computation
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the descriptional complexity of deterministic restarting automata, an automaton model inspired from linguistics. Variants of deterministic and monotone restarting automata build a strict hierarchy whose top is characterized by the Church-Rosser languages and whose bottom is characterized by the deterministic context-free languages. It is shown that between nondeterministic pushdown automata and any level of the hierarchy there are savings in the size of description which cannot be bounded by any recursive function. Interestingly, the converse is also true for the Church-Rosser languages. Moreover, there are non-recursive trade-offs between the family of Church-Rosser languages and any other level of the hierarchy.