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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 487; pp. 17 - 22
Main Authors:	Vázquez de Parga, Manuel, García, Pedro, López, Damián
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 27.05.2013
Subjects:	Atomic automata DFA minimization Polynomial double reversal algorithm DFA minimization Atomic automata Polynomial double reversal algorithm
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!