On path equivalence of nondeterministic finite automata (Q1351166)

From MaRDI portal
Revision as of 21:15, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references