Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
Some Results on Tape-Bounded Turing Machines
Journal of the ACM (JACM)
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Space complexity of alternating Turing machines
FCT '85 Fundamentals of Computation Theory
Converting two-way nondeterministic unary automata into simpler automata
Theoretical Computer Science - Mathematical foundations of computer science
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Deterministic moles cannot solve liveness
Journal of Automata, Languages and Combinatorics
Hierarchies of memory limited computations
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Two-way unary automata versus logarithmic space
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Nondeterminism is essential in small 2FAs with few reversals
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Two-Way automata making choices only at the endmarkers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Oblivious two-way finite automata: decidability and complexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
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 strengthen previously known connections between the size complexity of two-way finite automata (2FAS) and the space complexity of Turing machines. We prove that - every s-state 2NFA can be simulated on all poly(s)-long inputs by some poly(s)-state 2DFA if and only if NL ⊆ L/poly and - every s-state 2NFA can be simulated on all 2poly(s)-long inputs by some poly(s)-state 2DFA if and only if NLL ⊆ LL/polylog. Here, 2DFAS and 2NFAS are the deterministic and nondeterministic 2FAS, NL and L/poly are the standard space complexity classes, and NLL and LL/polylog are their counterparts for O(log log n) space and poly(log n) bits of advice. Our arguments strengthen and extend an old theorem by Berman and Lingas and can be used to obtain variants of the above statements for other modes of computation or other combinations of bounds for the input length, the space usage, and the length of advice.