Time complexity of loop-free two-way pushdown automata (Q1838833)

From MaRDI portal
Revision as of 06:29, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Time complexity of loop-free two-way pushdown automata
scientific article

    Statements

    Time complexity of loop-free two-way pushdown automata (English)
    0 references
    0 references
    1983
    0 references
    simulation
    0 references
    time complexity
    0 references
    algorithm for the fast recognition of languages recognized by two-way nondeterministic pushdown automata
    0 references

    Identifiers