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
Journal ArticleDOI
Uniformly bounded duplication languages
TL;DR: It is proved that all these languages are regular, any word has a unique uniformly bounded duplication root, and it is shown how this root can be computed in linear time and memory.
Journal ArticleDOI
Operations and language generating devices suggested by the genome evolution
TL;DR: The main emphasis is on the operations of inversion, transposition, duplication and deletion suggested by the genome evolution and a generative device based on these operations is investigated from different points of view.
Book
Evolutionary Genomics and Systems Biology
TL;DR: This book introduces the committee on genetics, genomics & systems biology and discusses yeast as a model organism for functional research article evolutionary genomics and adaptive why the authors need systems biology california state university.
Book ChapterDOI
Formal Languages Arising from Gene Repeated Duplication
TL;DR: Two types of languages defined by a string through iterative factor duplications, inspired by the process of tandem repeats production in the evolution of DNA are considered, and some conditions for the non-regularity of these languages are given.
Journal ArticleDOI
On regularity of languages generated by copying systems
TL;DR: In this paper, a sufficient condition for a copy language to be regular is provided; an application of this condition is demonstrated in the context of regular copy language construction, where the copying relation copy∗ is defined as the reflexive and transitive closure of copy, and a copying system is an ordered pair G = (Σ, w) where w ϵΣ+; its language is L(G) = {zϵ Σ + : w copy ∗ z}, it is referred to as a copy languages.