Hopcroft’s Minimization Technique: Queues or Stacks?

DOI10.1007/978-3-540-70844-5_9MaRDI QIDQ3602803zbMATH OpenOpenAlexFDO

Authors Andrei Păun, Mihaela Păun, Alfonso Rodríguez-Patón

Publication date 12 February 2009

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

Full work available at URL https://doi.org/10.1007/978-3-540-70844-5_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the Hopcroft's minimization technique for DFA and DFCA
• Hopcroft’s Algorithm and Cyclic Automata
• On extremal cases of Hopcroft's algorithm
• On Extremal Cases of Hopcroft’s Algorithm
• Hopcroft's algorithm and tree-like automata

Cites work

• scientific article; zbMATH DE number 1820028 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 1773088 (Why is no real title available?)
• scientific article; zbMATH DE number 2182451 (Why is no real title available?)
• scientific article; zbMATH DE number 2087235 (Why is no real title available?)
• scientific article; zbMATH DE number 1916664 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• scientific article; zbMATH DE number 3420624 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• A linear time solution to the single function coarsest partition problem
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• Around Hopcroft’s Algorithm
• Describing an algorithm by Hopcroft
• Efficient implementation of regular languages using reversed alternating finite automata
• Follow automata.
• From regular expressions to finite automata^∗
• Implementation and Application of Automata
• On the State Complexity of Combined Operations
• Re-describing an algorithm by Hopcroft

Cited in

(4)

• Hopcroft’s Algorithm and Cyclic Automata
• Hopcroft's algorithm and tree-like automata
• On the Hopcroft's minimization technique for DFA and DFCA
• On extremal cases of Hopcroft's algorithm

This page was built for publication: Hopcroft’s Minimization Technique: Queues or Stacks?

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