Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q114172424, #quickstatements; #temporary_batch_1719358096763 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114172424 / rank | |||
Normal rank | |||
Revision as of 00:30, 26 June 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
