Two-way unary automata versus logarithmic space
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Two-way unary automata versus logarithmic space
Information and Computation
Size complexity of rotating and sweeping automata
Journal of Computer and System Sciences
Two-Way automata making choices only at the endmarkers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
An alternating hierarchy for finite automata
Theoretical Computer Science
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Removing nondeterminism in constant height pushdown automata
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Analogs of fagin's theorem for small nondeterministic finite automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Nondeterminism is essential in small two-way finite automata with few reversals
Information and Computation
One alternation can be more powerful than randomization in small and fast two-way finite automata
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
This is a talk on the size complexity of two-way finite automata. We present the central open problem in the area, explain a motivation behind it, recall its early history, and introduce some of the concepts used in its study. We then sketch a possible future, describe a natural systematic way of pursuing it, and record some of the progress that has been achieved. We add little to what is already known--only exposition, terminology, and questions.