A challenging family of automata for classical minimization algorithms
DOI10.1007/978-3-642-18098-9_27zbMATH Open1297.68112OpenAlexW1867432232MaRDI QIDQ3073644FDOQ3073644
Authors: Cyril Nicaud, M. Sciortino, G. Castiglione 
Publication date: 11 February 2011
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_27
Recommendations
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
- Experimental Evaluation of Classical Automata Constructions
- Some combinatorial properties of Sturmian words
- Enumeration and generation with a string automata representation
- On the average complexity of Moore's state minimization algorithm
- On extremal cases of Hopcroft's algorithm
- Circular Sturmian words and Hopcroft's algorithm
- Minimisation of acyclic deterministic automata in linear time
- Sturmian trees
- Building the minimal automaton of \(A ^{*} X\) in linear time, when \(X\) is of bounded cardinality
Cited In (6)
- Two routes to automata minimization and the ways to reach it efficiently
- Minimisation of automata
- Nondeterministic Moore automata and Brzozowski's minimization algorithm
- Implementation and Application of Automata
- Nondeterministic Moore automata and Brzozowski's algorithm
- Standard Sturmian words and automata minimization algorithms
This page was built for publication: A challenging family of automata for classical minimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073644)
