A hardest language recognized by two-way nondeterministic pushdown automata (Q1158974)

From MaRDI portal
Revision as of 02:51, 14 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
A hardest language recognized by two-way nondeterministic pushdown automata
scientific article

    Statements

    title
    A hardest language recognized by two-way nondeterministic pushdown automata (English)
    0 references
    author
    Wojciech Rytter
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    language recognition
    0 references

    Identifiers

    zbMATH DE Number
    3744576
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1158974&oldid=1470338"
      Powered by MediaWiki