Open AccessJournal Article
Non-recursive trade-offs for deterministic restarting automata
Reads0
Chats0
TLDR
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.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.read more
Citations
More filters
Journal ArticleDOI
On stateless deterministic restarting automata
TL;DR: It is shown that the language classes defined by the various types of deterministic stateless restarting automata without auxiliary symbols are anti-AFLs that are not even closed under reversal.
Dissertation
Beschreibungskomplexität von Restart-Automaten.
TL;DR: Auskünfte und interessierten Gespräche bedanken die Pressekonferenz bei der Pressemitteilung “Gemeinsamkeit der Wirklichkeit, wie es sich registrieren kann”.
Journal Article
Restarting automata and their relations to the Chomsky hierarchy
TL;DR: A survey on the various models of restarting automata and their properties is given, their relationships to the language classes of the Chomsky hierarchy are described, and some open problems are presented.
Descriptional Complexity of Cellular Automata and Decidability Questions.
TL;DR: In this paper, the authors study the descriptional complexity of cellular automata, and show that between one of the simplest cellular models, the real-time one-way CA (real-time-OCA), and "classical" models like deterministic finite automata or pushdown automata there will be savings concerning the size of description not bounded by any recursive function, so-called nonrecursive trade-offs.
Book ChapterDOI
On Stateless Deterministic Restarting Automata
TL;DR: It is shown that the language classes defined by the various types of deterministic stateless restarting automata without auxiliary symbols are anti-AFLs that are not even closed under reversal.
References
More filters
Journal ArticleDOI
Church-Rosser Thue systems and formal languages
TL;DR: Three ways in which formal languages can be defined by Thue systems with the Church-Rosser property are studied, and some general results about the three families of languages so determined are studied.
Journal ArticleDOI
Growing context-sensitive languages and Church-Rosser languages
Gerhard Buntrock,Friedrich Otto +1 more
TL;DR: The class of (generalized) Church-Rosser languages and the class of context-free languages are incomparable under set inclusion, which verifies a conjecture of Mc-Naughton et al [MNO88].
Journal Article
On monotonic automata with a restart operation
Journal ArticleDOI
On the Succinctness of Different Representations of Languages
TL;DR: The purposes of this paper are to derive some new results about how the relative succinctness of representations change when the representations contain a formal proof that the languages generated are in the desired subclass of languages.