A Jumping 5'->3' Watson-Crick Finite Automata Model

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F22%3APU139480" target="_blank" >RIV/00216305:26230/22:PU139480 - isvavai.cz</a>
Result on the web
<a href="https://rdcu.be/cFzvd" target="_blank" >https://rdcu.be/cFzvd</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00236-021-00413-x" target="_blank" >10.1007/s00236-021-00413-x</a>

Result language
angličtina
Original language name
A Jumping 5'->3' Watson-Crick Finite Automata Model
Original language description
Jumping finite automata and sensing 5'->3' Watson-Crick finite automata are finite-state models of computation which allow to process the input word not only in the strictly left-to-right manner. In this paper a new combined model of them is presented. The accepting power of the new model is studied and compared with the original models and also other well-known language families. Furthermore, the paper investigates changes in the accepting power when commonly studied restrictions from Watson-Crick finite automata, e.g., all states are final, are applied to this combined model. In the end, the paper presents a comprehensive hierarchy of all related language families.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)