Two-way deterministic finite automata are exponentially more succinct than sweeping automata (Q1157965)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-way deterministic finite automata are exponentially more succinct than sweeping automata |
scientific article |
Statements
Two-way deterministic finite automata are exponentially more succinct than sweeping automata (English)
0 references
1981
0 references
complexity
0 references
size of description
0 references
nondeterminism
0 references
0 references
