On Extremal Cases of Hopcroft’s Algorithm
From MaRDI portal
Publication:3637337
DOI10.1007/978-3-642-02979-0_5zbMATH Open1248.68289OpenAlexW1590476269MaRDI QIDQ3637337FDOQ3637337
Authors: M. Sciortino, G. Castiglione, Antonio Restivo 
Publication date: 9 July 2009
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-02979-0_5
Recommendations
Cites Work
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
- Re-describing an algorithm by Hopcroft
- On Christoffel classes
- Implementation and Application of Automata
- Circular Sturmian words and Hopcroft's algorithm
- A linear time solution to the single function coarsest partition problem
- Hopcroft’s Algorithm and Cyclic Automata
- Sturmian trees
- Codes and equations on trees
- Special factors and uniqueness conditions in rational trees
Cited In (17)
- Words, trees and automata minimization
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
- Epichristoffel Words and Minimization of Moore Automata
- Minimisation of automata
- On the Hopcroft's minimization technique for DFA and DFCA
- Hopcroft’s Algorithm and Cyclic Automata
- Hopcroft's automaton minimization algorithm and Sturmian words
- On extremal cases of Hopcroft's algorithm
- Around Hopcroft’s Algorithm
- Extension of Hoshen-Kopelman algorithm to non-lattice environments
- Average complexity of Moore's and Hopcroft's algorithms
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
- A challenging family of automata for classical minimization algorithms
- Implementation and Application of Automata
- An extremal problem in the hypercube and optimization of asynchronous circuits
- Hopcroft’s Minimization Technique: Queues or Stacks?
- Hopcroft's algorithm and tree-like automata
Uses Software
This page was built for publication: On Extremal Cases of Hopcroft’s Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637337)
