Journal ArticleDOI
On the computational power of insertion-deletion systems
Reads0
Chats0
TLDR
The generative power of insertion-deletion systems (InsDel systems) is investigated, and it is shown that the family INS11DEL11 is equal to the family of recursively enumerable languages.Abstract:
Gene insertion and deletion are basic phenomena found in DNA processing or RNA editing in molecular biology. The genetic mechanism and development based on these evolutionary transformations have been formulated as a formal system with two operations of insertion and deletion, called insertion-deletion systems (Kari and Thierrin, 1996; Kari et al., 1997). We investigate the generative power of insertion-deletion systems (InsDel systems), and show that the family INS11 DEL11 is equal to the family of recursively enumerable languages. This gives a positive answer to an open problem posed in Kari et al. (1997) where it was conjectured contrary.read more
Citations
More filters
Journal ArticleDOI
Context-free insertion-deletion systems
TL;DR: It is found that set-conditional insertion-deletion systems with two axioms generate any recursively enumerable language, as well as that membrane systems with one membrane having context-free insertion- deleletion rules without conditional use of them generate all recursive enumerable languages.
Book ChapterDOI
Insertion-deletion systems with one-sided contexts
TL;DR: It is shown that a minimal deletion (of one symbol) in one-symbol one-sided context is sufficient for the computational completeness if a cooperation of 4 symbols is used for insertion rules and not sufficient if an insertion of one symbol in onesymbol left and right context is used.
Journal Article
Recent Developments on Insertion-Deletion Systems
TL;DR: The origin of these operations, their formal deflnition and a series of results concerning language properties, decidability and computational completeness of families of languages generated by insertion-deletion systems and their extensions with the graphcontrol.
Journal ArticleDOI
Biological hypercomputation: A new research problem in complexity theory
TL;DR: The meaning and scope of biological hypercomputation BH is discussed that is to be considered as new research problem within the sciences of complexity and the framework here is computational, setting out that life is not a standard Turing Machine.
Book ChapterDOI
Further Results on Insertion-Deletion Systems with One-Sided Contexts
TL;DR: The remaining open problem concerning the generative power of insertion-deletion systems having both contexts is solved by proving the computational completeness of systems having a context-free insertion of two symbols and a contextual deletion of one symbol.
References
More filters
Journal ArticleDOI
DNA computing
TL;DR: The concept of self-assembly, which biological systems have evolved to form such structures as viruses, flagella, and microtubules, can lead the way to using DNA as the basis of nanorobotics.
Journal ArticleDOI
Contextual Insertions/Deletions and Computability
Lila Kari,Gabriel Thierrin +1 more
TL;DR: It is proved that every Turing machine can be simulated by a system based entirely on contextual insertions and deletions and decidability of existence of solutions to equations involving these operations.