Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:53, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Converting nondeterministic two-way automata into small deterministic linear-time machines |
scientific article |
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
