Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419)

From MaRDI portal
Revision as of 19:07, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references
    0 references
    0 references
    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

    Identifiers