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

Authors:
F. Mráz;F. Otto;M. Plátek;T. Jurdziński
Affiliations:
Faculty of Mathematics and Physics, Department of Computer Science, Charles University, Prague, Czech Republic;Fachbereich Mathematik/Informatik, Universität Kassel, Kassel, Germany;Faculty of Mathematics and Physics, Department of Computer Science, Charles University, Prague, Czech Republic;Institute of Computer Science, University of Wrocław, Wrocław, Poland
Venue:
Theoretical Computer Science
Year:
2006

Citing 11
Cited 0

Context-free languages and pushdown automata

Handbook of formal languages, vol. 1
On monotonic automata with a restart operation

Journal of Automata, Languages and Combinatorics
Marcus Contextual Grammars

Marcus Contextual Grammars
Restarting Automata

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
A grammar based approach to a grammar checking of free word order languages

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Degrees of non-monotonicity for restarting automata

Theoretical Computer Science
Restarting automata and their relations to the Chomsky hierarchy

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Monotone deterministic RL-Automata don't need auxiliary symbols

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Modeling syntax of free word-order languages: dependency analysis by reduction

TSD'05 Proceedings of the 8th international conference on Text, Speech and Dialogue
On the complexity of 2-monotone restarting automata

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

The t-contextual grammars are generalizations of Marcus contextual grammars, which insert t contexts in each derivation step. If the selection mappings are regular and satisfy an additional locality restriction, then these grammars correspond in their expressive power to restarting automata with cut-index t. In the first part of the paper classes of languages are studied that are accepted by certain types of restarting automata with limited cut-index. As already R-automata with cut-index 1 accept NP-complete languages, additional restrictions in the form of certain monotonicity conditions are also considered. Without the locality restriction t-contextual grammars with regular selection correspond to t- RR-automata with cut-index one. These are RR-automata that are allowed to perform up to t deletion operations in each cycle that each delete a single factor only. In the second part of the paper the expressive power of these automata is studied, where the focus is on the special case that certain monotonicity conditions are satisfied.