Small sweeping 2NFAs are not closed under complement

Authors:
Christos A. Kapoutsis
Affiliations:
Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology
Venue:
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Year:
2006

Citing 3
Cited 10

A Note on Sweeping Automata

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

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory

Lower bounds on the size of sweeping automata

Journal of Automata, Languages and Combinatorics
A technique for proving lower bounds on the size of sweeping automata

Journal of Automata, Languages and Combinatorics
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
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
Minicomplexity

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Determinism vs. nondeterminism for two-way automata: representing the meaning of states by logical formulæ

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
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
Nondeterminism is essential in small two-way finite automata with few reversals

Information and Computation
Infinite vs. finite size-bounded randomized computations

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

A two-way nondeterministic finite automaton is sweeping (snfa) if its input head can change direction only on the end-markers. For every n, we exhibit a language that can be recognized by an n-state snfa but requires $2^{\varOmega(n)}$ states on every snfa recognizing its complement.