On path equivalence of nondeterministic finite automata (Q1351166)

From MaRDI portal
Revision as of 15:08, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
On path equivalence of nondeterministic finite automata
scientific article

    Statements

    On path equivalence of nondeterministic finite automata (English)
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    Algorithms
    0 references
    Computational complexity
    0 references
    Path equivalence
    0 references
    Automaton
    0 references