Equivalence problem of non-deterministic finite automata (Q1255319)

From MaRDI portal
Revision as of 03:06, 20 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Equivalence problem of non-deterministic finite automata
scientific article

    Statements

    Equivalence problem of non-deterministic finite automata (English)
    0 references
    1979
    0 references
    Equivalence Problem of Nondeterministic Finite Automata
    0 references
    Complexity
    0 references
    0 references

    Identifiers