The complexity of ranking simple languages (Q3034844)

From MaRDI portal
Revision as of 13:08, 20 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of ranking simple languages
scientific article

    Statements

    title
    The complexity of ranking simple languages (English)
    0 references
    DOI
    10.1007/BF02090763
    0 references
    author
    Dung T. Huynh
    0 references
    publication date
    1990
    0 references
    Mathematics Subject Classification ID
    68Q45
    0 references
    68Q25
    0 references
    68Q05
    0 references
    03D10
    0 references
    03D15
    0 references
    zbMATH DE Number
    4133520
    0 references
    zbMATH Keywords
    complexity of ranking
    0 references
    ranking languages
    0 references
    pushdown automata
    0 references
    Turing machines
    0 references
    finite automata
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3034844&oldid=34819143"
    Powered by MediaWiki