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ženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 487; s. 17 - 22
Hlavní autoři: Vázquez de Parga, Manuel, García, Pedro, López, Damián
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 27.05.2013
Témata:
Atomic automata
DFA minimization
Polynomial double reversal algorithm
DFA minimization
Atomic automata
Polynomial double reversal algorithm
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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