Watson–Crick Jumping Finite Automata
- 16 November 2020
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 31 (07) , 891-913
Abstract
Watson–Crick jumping finite automata work on tapes which are double stranded sequences of symbols similar to that of Watson–Crick automata. The double stranded sequence is scanned in a discontinuous manner. That is, after reading a double stranded string, the automata can jump over some subsequence and continue scanning depending on the rule. Some variants of such automata are 1-limited, No state, All final and Simple Watson–Crick jumping finite automata. The comparison of the languages accepted by these variants with the language classes in Chomsky hierarchy has been carried out. We investigate some closure properties. We also try to place the duplication closure of a word in Watson–Crick jumping finite automata family. We have discussed the closure property of Watson–Crick jumping finite automata family under duplication operations.Keywords
This publication has 16 references indexed in Scilit:
- One-Way Jumping Finite AutomataInternational Journal of Foundations of Computer Science, 2016
- Duplications and Pseudo-Duplications2015
- Bounded Prefix-Suffix DuplicationLecture Notes in Computer Science, 2014
- Evolutionary Genomics and Systems Biology2010
- Duplication in DNA Sequences2008
- Closure of Language Classes Under Bounded DuplicationLecture Notes in Computer Science, 2006
- Uniformly bounded duplication languagesDiscrete Applied Mathematics, 2005
- Operations and language generating devices suggested by the genome evolutionTheoretical Computer Science, 2001
- DNA computing, sticker systems, and universalityActa Informatica, 1998
- On regularity of languages generated by copying systemsDiscrete Applied Mathematics, 1984