Tight lower bounds on the size of sweeping automata

Journal of Computer and System Sciences

Volumn 63, Issue 3, 2001, Pages 384-393

  Leung, Hing ^a  

^a New Mexico State University   (United States)

Author keywords

Descriptional complexity; Deterministic finite automata; Nondeterministic finite automata; Sweeping automata; Two way finite automata

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FORMAL LANGUAGES; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING;

DESCRIPTIONAL COMPLEXITY; DETERMINISTIC FINITE AUTOMATA; NONDETERMINISTIC FINITE AUTOMATA; SWEEPING AUTOMATA; TIGHT LOWER BOUNDS; TWO WAY FINITE AUTOMATA;

FINITE AUTOMATA;

EID: 0035521356     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1783     Document Type: Article

References (10)

1. A note on sweeping automata
2. Finite automata and unary languages
3. Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata
4. Economy of description by automata, grammars, and formal systems
5. On the bounds for state-set size in the proofs of equivalence between deterministic, non-deterministic, and two-way finite automata
6. Two-way deterministic finite automata are exponentially more succinct than sweeping automata
7. Nondeterminism and the size of two way finite automata
8. Lower bounds on the size of sweeping automata