Book ChapterDOI
Watson-Crick Jumping Finite Automata
Kalpana Mahalingam,Rama Raghavan,Ujjwal Kumar Mishra +2 more
- Vol. 31, Iss: 07, pp 467-480
TLDR
This paper introduces a new automata called Watson-Crick jumping finite automata, working on tapes which are double stranded sequences of symbols, similar to that of a Watson- Crick automata.Abstract:
In this paper, we introduce a new automata called Watson-Crick jumping finite automata, working on tapes which are double stranded sequences of symbols, similar to that of a Watson-Crick automata. This automata scans the double stranded sequence in a discontinuous manner (i.e.) after reading a double stranded string, the automata can jump over some subsequence and continue scanning, depending on the rule. We define some variants of such automata and compare the languages accepted by these variants with the language classes in Chomsky hierarchy. We also investigate some closure properties.read more
Citations
More filters
Journal ArticleDOI
A jumping $$5'\rightarrow 3'$$ 5 ′ → 3 ′
TL;DR: The accepting power of the new model of Watson–Crick finite automata is studied and compared with the original models and also other well-known language families, and a comprehensive hierarchy of all related language families is presented.
On Regularity of Languages Generated by Copying Systems ; CU-CS-234-82
TL;DR: This note provides a sufficient condition for a copy language to be regular; an application of this condition is demonstrated.
Journal ArticleDOI
A jumping $5'\rightarrow 3'$ Watson-Crick finite automata model
Proceedings ArticleDOI
Watson-Crick grammar and its label languages
TL;DR: In this article , the Szilard control languages of a new type of computing model where the underlying model is based on the working of DNA molecules are investigated and compared with the family of control languages such as REG, CF and RE.
Posted Content
Generalized Circular One-Way Jumping Finite Automata.
TL;DR: In this article, a generalized linear one-way jumping finite automata (GLone-way-jumping-finite automata) model was defined and compared with the original one.
References
More filters
Book ChapterDOI
Duplication in DNA Sequences
TL;DR: In this paper, a characterization of regular languages that are generated by duplicating a regular language has been presented, and properties of these operations, such as closure properties of language families in the Chomsky hierarchy, language equations involving duplication and repeat-deletion have been investigated.
Book ChapterDOI
Duplications and Pseudo-Duplications
TL;DR: In this paper, the authors consider three variants of duplication operations, namely, duplication, pseudo-duplication and reverse duplication, and give the necessary and sufficient number of states that a non-deterministic finite automaton needs to recognize duplications on a string.
Book ChapterDOI
Bounded prefix-suffix duplication
TL;DR: The k-prefix-suffix duplication distance between two words is defined, extended to languages and shown how it can be computed for regular languages.