- -

On the Languages Accepted by Watson-Crick Finite Automata with Delays

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

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

On the Languages Accepted by Watson-Crick Finite Automata with Delays

Mostrar el registro sencillo del ítem

Ficheros en el ítem

Thumbnail
Nombre: Sempere - On the ...
Tamaño: 342.3Kb
Formato: PDF
Descripción: Versión editorial
Abrir
dc.contributor.author Sempere Luna, José María es_ES
dc.date.accessioned 2022-03-24T19:03:06Z
dc.date.available 2022-03-24T19:03:06Z
dc.date.issued 2021-04 es_ES
dc.identifier.uri http://hdl.handle.net/10251/181538
dc.description.abstract [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 the maximum length difference between the two input strands which is called the delay. We prove that the language class accepted by WKFA with such restrictions is a proper subclass of the languages accepted by arbitrary WKFA in general. In addition, we initiate the study of the language classes characterized by WKFAs with bounded delays. We prove some of the results by means of various relationships between WKFA and sticker systems. es_ES
dc.description.sponsorship This work has been developed with the financial support of the European Union's Horizon 2020 research and innovation programme under grant agreement No. 952215 corresponding to the TAILOR project. es_ES
dc.language Inglés es_ES
dc.publisher MDPI AG es_ES
dc.relation.ispartof Mathematics es_ES
dc.rights Reconocimiento (by) es_ES
dc.subject Watson-Crick finite automata es_ES
dc.subject Sticker systems es_ES
dc.subject DNA computing es_ES
dc.subject Formal languages es_ES
dc.title On the Languages Accepted by Watson-Crick Finite Automata with Delays es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.3390/math9080813 es_ES
dc.relation.projectID info:eu-repo/grantAgreement/EC/H2020/952215/EU/ es_ES
dc.rights.accessRights Abierto es_ES
dc.description.bibliographicCitation Sempere Luna, JM. (2021). On the Languages Accepted by Watson-Crick Finite Automata with Delays. Mathematics. 9(8):1-12. https://doi.org/10.3390/math9080813 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.3390/math9080813 es_ES
dc.description.upvformatpinicio 1 es_ES
dc.description.upvformatpfin 12 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 9 es_ES
dc.description.issue 8 es_ES
dc.identifier.eissn 2227-7390 es_ES
dc.relation.pasarela S\432874 es_ES
dc.contributor.funder COMISION DE LAS COMUNIDADES EUROPEA es_ES
upv.costeAPC 670 es_ES


Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem