On Extremal Cases of Hopcroft’s Algorithm

DOI10.1007/978-3-642-02979-0_5zbMath1248.68289OpenAlexW1590476269MaRDI QIDQ3637337

Marinella Sciortino, Giuseppa 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On extremal cases of Hopcroft's algorithm ⋮ Hopcroft's algorithm and tree-like automata ⋮ Average complexity of Moore's and Hopcroft's algorithms

Uses Software

• AMoRE

Cites Work

• Circular Sturmian words and Hopcroft's algorithm
• Sturmian trees
• A linear time solution to the single function coarsest partition problem
• Re-describing an algorithm by Hopcroft
• Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
• On Christoffel classes
• Hopcroft’s Algorithm and Cyclic Automata
• Implementation and Application of Automata
• Codes and equations on trees
• Special factors and uniqueness conditions in rational trees

This page was built for publication: On Extremal Cases of Hopcroft’s Algorithm