Vázquez-De-Parga Andrade, Manuel; García Gómez, Pedro; López Rodríguez, Damián(Elsevier, 2013-05)
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 ...
We here study previous results due to Hopcroft and Almeida et al. to
propose an incremental split-based deterministic automata minimization algorithm
whose average running-time does not depend on the size of the alphabet. ...
García Gómez, Pedro; López Rodríguez, Damián; Vázquez-De-Parga Andrade, Manuel(Elsevier, 2015-06)
In this paper, we show the relationship between the two most widely used approaches for the minimization of deterministic finite automata: minimization by split of partitions and minimization by double reversal. Even though ...
García Gómez, Pedro; López Rodríguez, Damián; Vázquez-De-Parga Andrade, Manuel(Universitat Politècnica de València, 2013-03-14)
Minimization of automata is a classic problem in Computer Sci- ence which is still studied nowadays. In this paper, we first propose a polynomial minimization method directly derived from Brzozowski¿s algorithm, and second, ...
Minimization of deterministic finite automata is a classic problem in Computer Science which is still studied nowadays. In this paper, we relate the different split-minimization methods proposed to date, or to be proposed, ...