Hopcroft’s Minimization Technique: Queues or Stacks?
From MaRDI portal
Publication:3602803
DOI10.1007/978-3-540-70844-5_9zbMath1172.68522OpenAlexW1836929802MaRDI QIDQ3602803
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
Related Items (1)
Cites Work
- A linear time solution to the single function coarsest partition problem
- Follow automata.
- Efficient implementation of regular languages using reversed alternating finite automata
- Re-describing an algorithm by Hopcroft
- Describing an algorithm by Hopcroft
- AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
- From regular expressions to finite automata∗
- Implementation and Application of Automata
- A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
- Around Hopcroft’s Algorithm
- On the State Complexity of Combined Operations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hopcroft’s Minimization Technique: Queues or Stacks?
