Sorting and doubling techniques for set partitioning and automata minimization problems

DOI10.1016/S0304-3975(99)00018-3zbMath0951.68060WikidataQ127682241 ScholiaQ127682241MaRDI QIDQ1575899

Djelloul Ziadi

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

automata minimization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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