Hopcroft’s Minimization Technique: Queues or Stacks?

DOI10.1007/978-3-540-70844-5_9zbMATH Open1172.68522OpenAlexW1836929802MaRDI QIDQ3602803FDOQ3602803

Mihaela Păun, Andrei 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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Follow automata.
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the State Complexity of Combined Operations
• Re-describing an algorithm by Hopcroft
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• Title not available (Why is that?)
• Implementation and Application of Automata
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• Describing an algorithm by Hopcroft
• A linear time solution to the single function coarsest partition problem
• From regular expressions to finite automata^∗
• Title not available (Why is that?)
• Around Hopcroft’s Algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient implementation of regular languages using reversed alternating finite automata

Cited In (2)

• Hopcroft’s Algorithm and Cyclic Automata
• Hopcroft's algorithm and tree-like automata

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)