Two-way deterministic finite automata are exponentially more succinct than sweeping automata
Work
Year: 1981
Type: article
Source: Information Processing Letters
Author Silvio Micali
Institution University of California, Berkeley
Cites: 4
Cited by: 42
Related to: 10
FWCI: 0.552
Citation percentile (by year/subfield): 88.21
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed