Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7629132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Converting nondeterministic two-way automata into small deterministic linear-time machines |
scientific article; zbMATH DE number 7629132 |
Statements
Converting nondeterministic two-way automata into small deterministic linear-time machines (English)
0 references
8 December 2022
0 references
one-tape Turing machines
0 references
two-way automata
0 references
descriptional complexity
0 references
Sakoda-Sipser conjecture
0 references
0.8725974559783936
0 references
0.8153505325317383
0 references
0.7892934679985046
0 references
