Membership for growing context-sensitive grammars is polynomial
Journal of Computer and System Sciences
Formal languages
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
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
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
Journal of Automata, Languages and Combinatorics
Multi-party finite computations
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Monotone deterministic RL-Automata don't need auxiliary symbols
DLT'05 Proceedings of the 9th 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
| Hi-index | 0.00 |
The restarting automaton is a restricted model of computation that was introduced by Jančar et al. to model the so-called analysis by reduction, which is a technique used in linguistics to analyse sentences of natural languages. The most general models of restarting automata make use of auxiliary symbols in their rewrite operations, although this ability does not directly correspond to any aspect of the analysis by reduction. 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.