A polynomial double reversal minimization algorithm for deterministic finite automata

We here propose a polynomial-time deterministic finite automaton minimization algorithm directly derived from Brzozowski’s double reversal algorithm. To do so, we take into account the framework by Brzozowski and Tamm, to propose an atomization algorithm that allows us to achieve polynomial time com...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 487; S. 17 - 22
Hauptverfasser: Vázquez de Parga, Manuel, García, Pedro, López, Damián
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 27.05.2013
Schlagworte:
Atomic automata
DFA minimization
Polynomial double reversal algorithm
DFA minimization
Atomic automata
Polynomial double reversal algorithm
ISSN:0304-3975, 1879-2294
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We here propose a polynomial-time deterministic finite automaton minimization algorithm directly derived from Brzozowski’s double reversal algorithm. To do so, we take into account the framework by Brzozowski and Tamm, to propose an atomization algorithm that allows us to achieve polynomial time complexity.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2013.03.005