Growing context-sensitive languages and Church-Rosser languages
Information and Computation
On monotonic automata with a restart operation
Journal of Automata, Languages and Combinatorics
Dependency Analyser Configurable by Measures
TSD '02 Proceedings of the 5th International Conference on Text, Speech and Dialogue
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
On the Complexity of 2-Monotone Restarting Automata
Theory of Computing Systems
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th 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
On restarting automata with window size one
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Correctness preservation and complexity of simple RL-automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. Here we introduce and study a new type of restarting automaton, the so-called t-sRL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. Here we study the gap-complexity of these automata. The membership problem for a language that is accepted by a t-sRL-automaton with a bounded number of gaps can be solved in polynomial time. On the other hand, t-sRL-automata with an unbounded number of gaps accept NP-complete languages.