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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theoretical computer science Ročník 487; s. 17 - 22
Hlavní autori: Vázquez de Parga, Manuel, García, Pedro, López, Damián
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 27.05.2013
Predmet:
Atomic automata
DFA minimization
Polynomial double reversal algorithm
DFA minimization
Atomic automata
Polynomial double reversal algorithm
ISSN:0304-3975, 1879-2294
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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