Equivalence problem of non-deterministic finite automata

DOI10.1016/0022-0000(79)90048-5zbMath0401.68028OpenAlexW1998090528MaRDI QIDQ1255319

Akihiro Nozaki

Publication date: 1979

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(79)90048-5

zbMATH Keywords

ComplexityEquivalence Problem of Nondeterministic Finite Automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (4)

Remarks on Separating Words ⋮ Equivalence problem of non-deterministic finite automata ⋮ Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs ⋮ On the lengths of values in a finite transducer

Cites Work

• Equivalence problem of non-deterministic finite automata
• Multiple-entry finite automata
• On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equivalence problem of non-deterministic finite automata