A technique for proving lower bounds on the size of sweeping automata

Authors:
Hing Leung
Affiliations:
Department of Computer Science, New Mexico State University, Las Cruces, NM
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2009

Citing 9
Cited 1

Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata

SIAM Journal on Computing
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
Succinctness of descriptions of context-free, regular and finite languages.

Succinctness of descriptions of context-free, regular and finite languages.
On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

IEEE Transactions on Computers
Economy of description by automata, grammars, and formal systems

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
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
Small sweeping 2NFAs are not closed under complement

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
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

Oblivious two-way finite automata: decidability and complexity

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A sweeping automaton is a two-way deterministic finite automaton which makes turns only at the endmarkers. Sipser [12] has proved that one-way nondeterministic finite automata can be exponentially more succinct in sizes than sweeping automata. In this paper, we propose a technique based on the work in [6] for establishing lower bounds on the size of sweeping automata. We show that Sipser's technique is a special case of our method. In addition, we prove two lower bound results with the new technique.