Two-way deterministic finite automata are exponentially more succinct than sweeping automata (Q1157965): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Nondeterminism and the size of two way finite automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two-way deterministic finite automata are exponentially more succinct than sweeping automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3938525 / rank | |||
Normal rank | |||
Latest revision as of 14:03, 13 June 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
0 references
