Two-way deterministic finite automata are exponentially more succinct than sweeping automata (Q1157965)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two-way deterministic finite automata are exponentially more succinct than sweeping automata |
scientific article; zbMATH DE number 3738926
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-way deterministic finite automata are exponentially more succinct than sweeping automata |
scientific article; zbMATH DE number 3738926 |
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
