Formal languages
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
On monotonic automata with a restart operation
Journal of Automata, Languages and Combinatorics
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
Computation with absolutely no space overhead
DLT'03 Proceedings of the 7th 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
| Hi-index | 0.00 |
The most general models of restarting automata make use of auxiliary symbols in their rewrite operations. Here we put restrictions on the way in which restarting automata use auxiliary symbols, and we investigate the influence of these restrictions on their expressive power. In fact, we consider two types of restrictions. First, we consider the number of auxiliary symbols in the tape alphabet of a restarting automaton as a measure of its descriptional complexity. Secondly, we consider the number of occurrences of auxiliary symbols on the tape as a dynamic complexity measure. We establish some lower and upper bounds with respect to these complexity measures concerning the ability of restarting automata to recognize the (deterministic) context-free languages and some of their subclasses.