[图书][B] DNA computing: new computing paradigms

G Paun, G Rozenberg, A Salomaa - 2005 - books.google.com
This is the first book on DNA computing, a molecular approach that may revolutionize
computing-replacing silicon with carbon and microchips with DNA molecules. The book …

Networks of evolutionary processors

J Castellanos, C Martín-Vide, V Mitrana, JM Sempere - Acta informatica, 2003 - Springer
In this paper we consider networks of evolutionary processors as language generating and
computational devices. When the filters are regular languages one gets the computational …

Context-free insertion–deletion systems

M Margenstern, G Păun, Y Rogozhin… - Theoretical computer …, 2005 - Elsevier
We consider a class of insertion–deletion systems which have not been investigated so far,
those without any context controlling the insertion–deletion operations. Rather …

On the computational power of insertion-deletion systems

A Takahara, T Yokomori - Natural Computing, 2003 - Springer
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 …

[PDF][PDF] Using DNA to solve the bounded post correspondence problem

L Kari, G Gloor, S Yu - Theoretical Computer Science, 2000 - csd.uwo.ca
Theoretical research in DNA computing includes designing practical experiments for solving
various computational problems by means of DNA manipulation. This paper proposes a …

Hybrid networks of evolutionary processors

C Martin-Vide, V Mitrana, MJ Perez-Jimenez… - Genetic and …, 2003 - Springer
A hybrid network of evolutionary processors consists of several processors which are placed
in nodes of a virtual graph and can perform one simple operation only on the words existing …

Graph-controlled insertion-deletion systems

R Freund, M Kogler, Y Rogozhin, S Verlan - arXiv preprint arXiv …, 2010 - arxiv.org
In this article, we consider the operations of insertion and deletion working in a graph-
controlled manner. We show that like in the case of context-free productions, the …

[PDF][PDF] On minimal context-free insertion-deletion systems

S Verlan - J. Autom. Lang. Comb., 2007 - researchgate.net
We investigate the class of context-free insertion-deletion systems. It is known that such
systems are universal if the length of the inserted/deleted string is at least three. We show …

Insertion-deletion systems with one-sided contexts

A Matveevici, Y Rogozhin, S Verlan - Machines, Computations, and …, 2007 - Springer
It was shown in (Verlan, 2005) that complexity measures for insertion-deletion systems need
a revision and new complexity measures taking into account the sizes of both left and right …

Computational power of insertion–deletion (P) systems with rules of size two

A Krassovitskiy, Y Rogozhin, S Verlan - Natural Computing, 2011 - Springer
This article investigates insertion–deletion systems of small size, where at most two symbols
can be used in the description of insertion or deletion rules in a context-free or contextual …