Nondeterministic Moore automata and Brzozowski's minimization algorithm
From MaRDI portal
Publication:442154
Recommendations
Cites work
- 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?)
- scientific article; zbMATH DE number 7354705 (Why is no real title available?)
- scientific article; zbMATH DE number 3264952 (Why is no real title available?)
- scientific article; zbMATH DE number 3420624 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- A challenging family of automata for classical minimization algorithms
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
- Experimental Evaluation of Classical Automata Constructions
- Hopcroft's algorithm and tree-like automata
- Lattice Automata
- Minimization algorithms for sequential transducers
- Minimizing deterministic lattice automata
- On extremal cases of Hopcroft's algorithm
- On the State Minimization of Nondeterministic Finite Automata
- Optimal simulation of self-verifying automata by deterministic automata
- Weighted automata algorithms
This page was built for publication: Nondeterministic Moore automata and Brzozowski's minimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442154)