On monotonic automata with a restart operation
Journal of Automata, Languages and Combinatorics
Monotonic Rewriting Automata with a Restart Operation
SOFSEM '97 Proceedings of the 24th Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Restarting automata with restricted utilization of auxiliary symbols
Theoretical Computer Science - Implementation and application of automata
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
On determinism versus nondeterminism for restarting automata
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 lexicalized well-behaved restarting automata that are monotone
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On nonforgetting restarting automata that are deterministic and/or monotone
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Correctness preservation and complexity of simple RL-automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Monotone deterministic RL-Automata don't need auxiliary symbols
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
On the complexity of 2-monotone restarting automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On left-monotone deterministic restarting automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On the gap-complexity of simple RL-Automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Restricting the use of auxiliary symbols for restarting automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
| Hi-index | 0.00 |
We introduce restarting automata as two-way automata in order to obtain a more general model which is closer to our linguistic motivations. We study the notion of j-monotonicity to show the advantages of this model. We show that the j-monotonicity can be considered as a degree of non-context-freeness and that it is a robust notion due to the considered models of restarting automata. Some other aspects concerning power and applications of two-way restarting automata are mentioned.