Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Lower bounds on the size of sweeping automata
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Finite automata and their decision problems
IBM Journal of Research and Development
The reduction of two-way automata to one-way automata
IBM Journal of Research and Development
Reversal hierarchies for small 2DFAs
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Hi-index | 0.89 |
We prove that limiting the number of reversals from two to one can cause an exponential blow-up in the size of two-way deterministic automaton.