Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952)

From MaRDI portal
Revision as of 19:37, 5 July 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
Descriptional Complexity of Input-Driven Pushdown Automata
scientific article

    Statements

    title
    Descriptional Complexity of Input-Driven Pushdown Automata (English)
    0 references
    author
    Alexander Okhotin
    0 references
    Xiaoxue Piao
    0 references
    Kai Salomaa
    0 references
    publication date
    1 November 2012
    0 references
    zbMATH Keywords
    descriptional complexity
    0 references
    state complexity
    0 references
    nondeterminism
    0 references
    input-driven pushdown
    0 references
    cites work
    Q3341935
    0 references
    Q3219133
    0 references
    Q3505883
    0 references
    Q5628039
    0 references
    Q3890112
    0 references
    Q5541339
    0 references
    Q4714446
    0 references

    Identifiers

    zbMATH DE Number
    6101065
    0 references
    OpenAlex ID
    W3756466
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3166952&oldid=35305654"
    Powered by MediaWiki