Two-way deterministic finite automata are exponentially more succinct than sweeping automata (Q1157965): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:34, 31 January 2024
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
