Hopcroft’s Algorithm and Cyclic Automata
From MaRDI portal
Publication:3540107
DOI10.1007/978-3-540-88282-4_17zbMATH Open1163.68021OpenAlexW1528377058MaRDI QIDQ3540107FDOQ3540107
Authors: M. Sciortino, G. Castiglione, Antonio Restivo 
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
Recommendations
- On Extremal Cases of Hopcroft’s Algorithm
- Implementation and Application of Automata
- On extremal cases of Hopcroft's algorithm
- Re-describing an algorithm by Hopcroft
- Circular Sturmian words and Hopcroft's algorithm
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
- Hopcroft's algorithm and tree-like automata
- Average complexity of Moore's and Hopcroft's algorithms
- Hopcroft’s Minimization Technique: Queues or Stacks?
- Hopcroft's automaton minimization algorithm and Sturmian words
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Experimental Evaluation of Classical Automata Constructions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Incremental Construction of Minimal Acyclic Finite-State Automata
- Re-describing an algorithm by Hopcroft
- On Christoffel classes
- Implementation and Application of Automata
- Describing an algorithm by Hopcroft
- Minimisation of acyclic deterministic automata in linear time
- Title not available (Why is that?)
- Around Hopcroft’s Algorithm
Cited In (23)
- Novel results on the number of runs of the Burrows-Wheeler-transform
- Average case analysis of Moore's state minimization algorithm
- Lowerbounds for Bisimulation by Partition Refinement
- Circular Sturmian words and Hopcroft's algorithm
- Minimisation of automata
- On the Hopcroft's minimization technique for DFA and DFCA
- Re-describing an algorithm by Hopcroft
- New string attractor-based complexities for infinite words
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
- On extremal cases of Hopcroft's algorithm
- Around Hopcroft’s Algorithm
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
- 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
- Standard Sturmian words and automata minimization algorithms
- Hyper-minimisation Made Efficient
- On Extremal Cases of Hopcroft’s Algorithm
- A combinatorial view on string attractors
- Hopcroft’s Minimization Technique: Queues or Stacks?
- String attractors and infinite words
- Hopcroft's algorithm and tree-like automata
This page was built for publication: Hopcroft’s Algorithm and Cyclic Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540107)
