Around Hopcroft’s Algorithm

DOI10.1007/11812128_12MaRDI QIDQ5757215zbMATH OpenOpenAlexFDO

Authors Manuel Baclet, Claire Pagetti

Publication date 6 September 2007

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.7602

zbMATH Keywords

finite automataHopcroft's algorithmminimization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On Extremal Cases of Hopcroft’s Algorithm
• On extremal cases of Hopcroft's algorithm
• On Holt's algorithm
• Re-describing an algorithm by Hopcroft
• An axiomatic approach to the Korenjak-Hopcroft algorithms
• A rupestrian algorithm
• Cornacchia's algorithm
• A proof of Holt's algorithm
• Hopcroft’s Algorithm and Cyclic Automata
• scientific article; zbMATH DE number 5984

Cited in

(9)

• On the Hopcroft's minimization technique for DFA and DFCA
• Searching around \(H_*^{alg}(-)\)
• Minimisation of automata
• Francis’s Algorithm
• Hopcroft’s Algorithm and Cyclic Automata
• Hopcroft’s Minimization Technique: Queues or Stacks?
• Generating tokenizers with flat automata
• Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable
• Average complexity of Moore's and Hopcroft's algorithms

This page was built for publication: Around Hopcroft’s Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757215)