Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal (Q656586)
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 automata with two reversals are exponentially more succinct than with one reversal |
scientific article; zbMATH DE number 5998996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal |
scientific article; zbMATH DE number 5998996 |
Statements
Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal (English)
0 references
18 January 2012
0 references
formal languages
0 references
regular languages
0 references
two-way finite automata
0 references
bounded number of reversals
0 references
0 references
