Growing context-sensitive languages and Church-Rosser languages
Information and Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Catalytic P systems, semilinear sets, and vector addition systems
Theoretical Computer Science
Succinct description of regular languages by weak restarting automata
Information and Computation
Non-recursive trade-offs for deterministic restarting automata
Journal of Automata, Languages and Combinatorics
Finite automata and their decision problems
IBM Journal of Research and Development
Information and Computation
Δ-clearing restarting automata and CFL
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On CD-systems of stateless deterministic R-automata with window size one
Journal of Computer and System Sciences
| Hi-index | 0.00 |
The transitions of a stateless automaton do not depend on internal states but solely on the symbols currently scanned by its heads accessing the input or memory. We investigate stateless deterministic restarting automata that, after executing a rewrite step, continue to read their tape before performing a restart. Even the weakest class thus obtained contains the regular languages properly. The relations between different classes of stateless automata as well as between stateless automata and the corresponding types of automata with states are investigated, and it is shown that the language classes defined by the various types of deterministic stateless restarting automata without auxiliary symbols are anti-AFLs that are not even closed under reversal.