- -

Listar por autor "Vázquez-De-Parga Andrade, Manuel"

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Listar por autor "Vázquez-De-Parga Andrade, Manuel"

Ordenar por:Orden:Resultados:

  • Icon
    A polynomial double reversal minimization algorithm for deterministic finite automata 
    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 ...
  • thumb
    A split-based incremental deterministic automata minimization algorithm 
    García Gómez, Pedro; Vázquez-De-Parga Andrade, Manuel; Velasco, Jairo A.; López Rodríguez, Damián (Springer, 2014-10-24)
    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. ...
  • thumb
    A sufficient condition to polynomially compute a minimum separating DFA 
    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 ...
  • thumb
    Autómatas finitos: irreducibilidad e Inferencia 
    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 ...
  • thumb
    DFA minimization: Double reversal versus split minimization algorithms 
    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 ...
  • thumb
    DFA minimization: from Brzozowski to Hopcroft 
    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, ...
  • thumb
    Efficient deterministic finite automata split-minimization derived from Brzozowski's algorithm 
    García Gómez, Pedro; López Rodríguez, Damián; Vázquez-De-Parga Andrade, Manuel (World Scientific Publishing, 2014-09)
    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, ...
  • thumb
    Genaro: Generador de código gvHIDRA 
    Morell Sendra, José (Universitat Politècnica de València, 2014-10-21)
    Este proyecto se centra en la creación de un generador de código de aplicaciones gvHIDRA (Generalitat Valenciana Herramienta Integral de Desarrollo Rápido de Aplicaciones), que mediante una interfaz gráfica, permite crear ...
  • thumb
    Polynomial characteristic sets for DFA identification 
    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 ...