A split-based incremental deterministic automata minimization algorithm

DOI10.1007/s00224-014-9588-yzbMath1335.68119OpenAlexW2078189513WikidataQ58209329 ScholiaQ58209329MaRDI QIDQ905684

Pedro García, Jairo A. Velasco, Damián López, Manuel Vázquez de Parga

Publication date: 28 January 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/51687

zbMATH Keywords

finite automataDFA minimizationincremental minimization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

From tree automata to string automata minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
• Average complexity of Moore's and Hopcroft's algorithms
• Re-describing an algorithm by Hopcroft
• Describing an algorithm by Hopcroft
• Incremental DFA Minimisation
• A First Investigation of Sturmian Trees
• Applications of Symbolic Finite Automata

This page was built for publication: A split-based incremental deterministic automata minimization algorithm