Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars

Authors:
Tomasz Jurdziński;Friedrich Otto;František Mráz;Martin Plátek
Affiliations:
Fachbereich Mathematik/Informatik, Universität Kassel, Germany;Fachbereich Mathematik/Informatik, Universität Kassel, Germany;Charles University, Department of Computer Science, Praha, Czech Republic. platek@ksi.ms.mff.cuni.cz;Charles Univ., Dept. of Comp. Sci., Praha, Czech Rep.. platek@ksi.ms.mff.cuni.cz (Corresp. Charles Univ., Fac. of Math. and Phys., Dept. of Comp. Sci., Malostranské nám. 25, 118 00 PRAHA ...
Venue:
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Year:
2004

Citing 4
Cited 3

Contextual grammars and natural languages

Handbook of formal languages, vol. 2
Marcus Contextual Grammars

Marcus Contextual Grammars
Restarting Automata

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Two-Way Restarting Automata and J-Monotonicity

SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics

Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata

Theoretical Computer Science
Degrees of non-monotonicity for restarting automata

Theoretical Computer Science
Monotone deterministic RL-Automata don't need auxiliary symbols

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that for (right-) monotone deterministic one-way restarting automata, the use of auxiliary symbols does not increase the expressive power. Here we show that the same is true for deterministic two-way restarting automata that are right-left-monotone. Moreover, we present a transformation of this kind of restarting automata into contextual grammars with regular selection.