- -

Listar por palabra clave "Formal languages"

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

Listar por palabra clave "Formal languages"

Ordenar por:Orden:Resultados:

  • thumb
    A positive extension of Eilenberg's variety theorem for non-regular languages 
    Cano Gómez, Antonio; Cantero Delgado, Jesús; Martínez-Pastor, Ana (Springer-Verlag, 2021-11)
    [EN] In this paper we go further with the study initiated by Behle, Krebs and Reifferscheid (in: Proceedings CAI 2011, Lecture Notes in Computer Science, vol 6742, pp 97-114, 2011), who gave an Eilenberg-type theorem for ...
  • Icon
    Diseño e implementación de un analizador de biosecuencias: Análisis de la elongación en horquilla 
    Diez Alba, Carlos (Universitat Politècnica de València, 2016-09-05)
    [ES] Mediante este proyecto se plantea el diseño de un analizador de biosecuencias centrado en el análisis de la elongación en horquilla (hairpin lengthening), una operación natural sobre lenguajes formales inspirada en ...
  • thumb
    Diseño e implementación de un analizador de biosecuencias: Análisis de subsecuencias de repetición 
    Villar Lafuente, Carlos José (Universitat Politècnica de València, 2016-09-07)
    [ES] En el presente TFG se desarrollará un analizador de secuencias de carácter bioquímico (fundamentalmente, secuencias de ADN y de ARN) para la búsqueda de posibles mutaciones debidas a la repetición de subsecuencias. ...
  • thumb
    Formations of monoids, congruences, and formal languages 
    Ballester Bolinches, Adolfo; Cosme-Llópez, E.; Esteban Romero, Ramón; Rutten, J.J.M.M. (Alexandru Ioan Cuza University of Iasi, 2015)
    The main goal in this paper is to use a dual equivalence in automata theory started in [25] and developed in [3] to prove a general version of the Eilenberg-type theorem presented in [4]. Our principal results confirm the ...
  • thumb
    Generating networks of genetic processors 
    Campos Frances, Marcelino; Sempere Luna, José María (Springer-Verlag, 2022-03)
    [EN] The Networks of Genetic Processors (NGPs) are non-conventional models of computation based on genetic operations over strings, namely mutation and crossover operations as it was established in genetic algorithms. ...
  • thumb
    On Compensation Loops in Genomic Duplications 
    Sempere Luna, José María (World Scientific, 2020-01)
    [EN] In this paper, we investigate the compensation loops, a DNA rearrangement in chromosomes due to unequal crossing over. We study the e fect of compensation loops over the gene duplication, and we formalize it as a ...
  • thumb
    On the Languages Accepted by Watson-Crick Finite Automata with Delays 
    Sempere Luna, José María (MDPI AG, 2021-04)
    [EN] In this work, we analyze the computational power of Watson-Crick finite automata (WKFA) if some restrictions over the transition function in the model are imposed. We consider that the restrictions imposed refer to ...