Proceedings of the 7th Colloquium on Automata, Languages and Programming
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Complementing two-way finite automata
Information and Computation
An exponential gap between Las Vegas and deterministic sweeping finite automata
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Size complexity of rotating and sweeping automata
Journal of Computer and System Sciences
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Nondeterminism is essential in small two-way finite automata with few reversals
Information and Computation
| Hi-index | 0.00 |
We examine the succinctness of one-way, rotating, sweeping, and two-waydeterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfais a 2dfawhose head can change direction only on the endmarkers and a rdfais a sdfawhose head is reset on the left end of the input every time the right endmarker is read. We introduce a list of language operators and study the corresponding closure properties of the size complexity classes defined by these automata. Our conclusions reveal the logical structure of certain proofs of known separations in the hierarchy of these classes and allow us to systematically construct alternative problems to witness these separations.