Nondeterministic Moore automata and Brzozowski's minimization algorithm
From MaRDI portal
Publication:442154
DOI10.1016/J.TCS.2012.04.029zbMATH Open1280.68116OpenAlexW2007783859MaRDI QIDQ442154FDOQ442154
Authors: Antonio Restivo, M. Sciortino, G. Castiglione 
Publication date: 9 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.029
Recommendations
Cites Work
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
- Title not available (Why is that?)
- Experimental Evaluation of Classical Automata Constructions
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the State Minimization of Nondeterministic Finite Automata
- Minimization algorithms for sequential transducers
- On extremal cases of Hopcroft's algorithm
- Lattice Automata
- Hopcroft's algorithm and tree-like automata
- A challenging family of automata for classical minimization algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weighted automata algorithms
- Optimal simulation of self-verifying automata by deterministic automata
- Title not available (Why is that?)
- Minimizing deterministic lattice automata
Cited In (1)
Uses Software
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)
