Detail publikace

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

KOCMAN, R. KŘIVKA, Z. MEDUNA, A. NAGY, B.

Originální název

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

Typ

článek v časopise ve Web of Science, Jimp

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

jumping automata, Watson-Crick automata, DNA computer, 2-head automata, discontinuous information processing, formal languages

Autoři

KOCMAN, R.; KŘIVKA, Z.; MEDUNA, A.; NAGY, B.

Vydáno

24. 1. 2022

ISSN

0001-5903

Periodikum

Acta Informatica

Ročník

59

Číslo

5

Stát

Spolková republika Německo

Strany od

557

Strany do

584

Strany počet

28

URL

https://rdcu.be/cFzvd

BibTex

@article{BUT169467,
  author="KOCMAN, R. and KŘIVKA, Z. and MEDUNA, A. and NAGY, B.",
  title="A Jumping 5'->3' Watson-Crick Finite Automata Model",
  journal="Acta Informatica",
  year="2022",
  volume="59",
  number="5",
  pages="557--584",
  doi="10.1007/s00236-021-00413-x",
  issn="0001-5903",
  url="https://rdcu.be/cFzvd"
}