Hopcroft’s Algorithm and Cyclic Automata
From MaRDI portal
Publication:3540107
DOI10.1007/978-3-540-88282-4_17zbMath1163.68021OpenAlexW1528377058MaRDI QIDQ3540107
Marinella Sciortino, Antonio Restivo, Giuseppa Castiglione
Publication date: 20 November 2008
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_17
Related Items (16)
Novel results on the number of runs of the Burrows-Wheeler-transform ⋮ Hyper-minimisation Made Efficient ⋮ String attractors and infinite words ⋮ Lowerbounds for Bisimulation by Partition Refinement ⋮ Average case analysis of Moore's state minimization algorithm ⋮ An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton ⋮ On extremal cases of Hopcroft's algorithm ⋮ A combinatorial view on string attractors ⋮ Standard Sturmian words and automata minimization algorithms ⋮ Hopcroft's algorithm and tree-like automata ⋮ Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm ⋮ Circular Sturmian words and Hopcroft's algorithm ⋮ An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton ⋮ On Extremal Cases of Hopcroft’s Algorithm ⋮ Average complexity of Moore's and Hopcroft's algorithms ⋮ Minimisation of automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimisation of acyclic deterministic automata in linear time
- Re-describing an algorithm by Hopcroft
- Describing an algorithm by Hopcroft
- On Christoffel classes
- Incremental Construction of Minimal Acyclic Finite-State Automata
- Experimental Evaluation of Classical Automata Constructions
- Implementation and Application of Automata
- Around Hopcroft’s Algorithm
This page was built for publication: Hopcroft’s Algorithm and Cyclic Automata
