Nondeterministic Moore automata and Brzozowski's algorithm
From MaRDI portal
Recommendations
- Nondeterministic Moore automata and Brzozowski's minimization algorithm
- scientific article; zbMATH DE number 3876608
- Brzozowski's minimization algorithm -- more robust than expected (extended abstract)
- Algebra-coalgebra duality in Brzozowski's minimization algorithm
- scientific article; zbMATH DE number 1543070
Cites work
- A challenging family of automata for classical minimization algorithms
- Circular Sturmian words and Hopcroft's algorithm
- Experimental Evaluation of Classical Automata Constructions
- scientific article; zbMATH DE number 1361134 (Why is no real title available?)
- scientific article; zbMATH DE number 1543070 (Why is no real title available?)
- scientific article; zbMATH DE number 798342 (Why is no real title available?)
- Minimization algorithms for sequential transducers
- On extremal cases of Hopcroft's algorithm
- On the State Minimization of Nondeterministic Finite Automata
- Optimal simulation of self-verifying automata by deterministic automata
Cited in
(5)- On Boyer-Moore automata
- scientific article; zbMATH DE number 3876608 (Why is no real title available?)
- Nondeterministic Moore automata and Brzozowski's minimization algorithm
- scientific article; zbMATH DE number 1543070 (Why is no real title available?)
- Algebra-coalgebra duality in Brzozowski's minimization algorithm
This page was built for publication: Nondeterministic Moore automata and Brzozowski's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200055)