EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM

DOI10.1142/S0129054114500282zbMath1304.68102WikidataQ58209330 ScholiaQ58209330MaRDI QIDQ2941086

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

Publication date: 21 January 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

DFA minimizationBrzozowski's algorithmHopcroft's algorithm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Standard Sturmian words and automata minimization algorithms

Cites Work

• A polynomial double reversal minimization algorithm for deterministic finite automata
• An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
• Re-describing an algorithm by Hopcroft
• Describing an algorithm by Hopcroft
• A geometrical view of the determinization and minimization of finite-state automata
• MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON

This page was built for publication: EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM