Two-way deterministic finite automata are exponentially more succinct than sweeping automata (Q1157965): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:23, 5 March 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
