Nondeterminism is essential in small two-way finite automata with few reversals

Authors:
Christos A. Kapoutsis
Affiliations:
Laboratoire dInformatique Algorithmique: Fondements et Applications, Université Paris VII, France
Venue:
Information and Computation
Year:
2013

Citing 13
Cited 2

Converting two-way nondeterministic unary automata into simpler automata

Theoretical Computer Science - Mathematical foundations of computer science
Descriptional complexity of finite automata: concepts and open problems

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Nondeterminism and the size of two way finite automata

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Algorithms and lower bounds in finite automata size complexity

Algorithms and lower bounds in finite automata size complexity
On the Size Complexity of Rotating and Sweeping Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Deterministic moles cannot solve liveness

Journal of Automata, Languages and Combinatorics
Size Complexity of Two-Way Finite Automata

DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Nondeterminism versus determinism for two-way finite automata: generalizations of Sipser's separation

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Two-way unary automata versus logarithmic space

Information and Computation
Two-way automata versus logarithmic space

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Small sweeping 2NFAs are not closed under complement

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Minicomplexity

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Reversal hierarchies for small 2DFAs

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Minicomplexity

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Reversal hierarchies for small 2DFAs

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

On every n-long input, every two-way finite automaton (2fa) can reverse its input head O(n) times before halting. A 2fawith few reversals is an automaton where this number is only o(n). For every h, we exhibit a language that can be recognized by an h-state nondeterministic 2fa with few reversals, but requires @W(2^h) states on every deterministic 2fa with few reversals.