Unboundedness and downward closures of higher-order pushdown automata (Q2828251)

From MaRDI portal
Revision as of 08:51, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Unboundedness and downward closures of higher-order pushdown automata
scientific article

    Statements

    Unboundedness and downward closures of higher-order pushdown automata (English)
    0 references
    24 October 2016
    0 references
    automata
    0 references
    concurrency
    0 references
    downwards closures
    0 references
    formal languages
    0 references
    functional programs
    0 references
    higher-order programs
    0 references
    model checking
    0 references
    Parikh images
    0 references
    pushdown automata
    0 references
    verification
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references