Sorting and doubling techniques for set partitioning and automata minimization problems
From MaRDI portal
Publication:1575899
DOI10.1016/S0304-3975(99)00018-3zbMath0951.68060WikidataQ127682241 ScholiaQ127682241MaRDI QIDQ1575899
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear time solution to the single function coarsest partition problem
- Describing an algorithm by Hopcroft
- The Compilation of Regular Expressions into Integrated Circuits
- A parallel algorithm for the minimization of finite state automata