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. ...
Vázquez-De-Parga Andrade, Manuel; García Gómez, Pedro; López Rodríguez, Damián(Elsevier, 2016-11-20)
The computation of a minimal separating automaton (MSA) for regular languages has been
studied from many different points of view, from synthesis of automata or Grammatical Inference
to the minimization of incompletely ...
Vázquez-De-Parga Andrade, Manuel(Universitat Politècnica de València, 2008-06-20)
En este trabajo abordamos dos problemas: El de la reducción de autómatas finitos y el de
la inferencia de los lenguajes regulares y estudiamos las relaciones entre ellos.
Tras la introducción, en el segundo capítulo se ...
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, ...
Álvarez Vargas, Gloria Inés(Universitat Politècnica de València, 2008-05-07)
Esta investigación aborda el tema del diseño de algoritmos de inferencia gramatical para lenguajes regulares, particularmente en lo relacionado con la mezcla de estados como elemento fundamental del proceso de inferencia. ...
Several methods have been developed to construct -free automata that represent a regular expression. Among the most widely known are the position automaton (Glushkov), the partial derivatives automaton (Antimirov) and the ...
García Gómez, Pedro; López Rodríguez, Damián; Vázquez-De-Parga Andrade, Manuel(Elsevier, 2012-08)
[EN] We study the order in Grammatical Inference algorithms, and its influence on the polynomial (with respect to the data) identification of languages. This work is motivated by recent results on the polynomial convergence ...