Two decidability results for deterministic pushdown automata (Q1254241)

From MaRDI portal
Revision as of 00:24, 13 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
Two decidability results for deterministic pushdown automata
scientific article

    Statements

    Two decidability results for deterministic pushdown automata (English)
    0 references
    1979
    0 references
    Decidability
    0 references
    Deterministic Pushdown Automata
    0 references
    Equivalence Problem
    0 references
    Stack Uniform Automata
    0 references
    Inclusion Problem
    0 references
    0 references

    Identifiers

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