Regular ArticleTight Lower Bounds on the Size of Sweeping Automata
Under an Elsevier user license
open archive
Keywords
deterministic finite automata
nondeterministic finite automata
two-way finite automata
sweeping automata
descriptional complexity
Cited by (0)
- f1
E-mail: [email protected]
- 1
This work was done during a visit of the Department of Computer Science, University of Hong Kong, supported by RGC Research Grant HKU 439/94E.
Copyright © 2001 Elsevier Science (USA). All rights reserved.