[图书][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 …

Reformulation of XML queries and constraints

A Deutsch, V Tannen - International Conference on Database Theory, 2002 - Springer
We state and solve the query reformulation problem for XML publishing in a general setting
that allows mixed (XML and relational) storage for the proprietary data and exploits …

[图书][B] Marcus contextual grammars

G Paun - 2013 - books.google.com
Marcus Contextual Grammars is the first monograph to present a class of grammars
introduced about three decades ago, based on the fundamental linguistic phenomenon of …

Contextual insertions/deletions and computability

L Kari, G Thierrin - Information and computation, 1996 - Elsevier
We investigate two generalizations of insertion and deletion of words, that have recently
become of interest in the context of molecular computing. Given a pair of words (x, y), called …

Shuffle on trajectories: Syntactic constraints

A Mateescu, G Rozenberg, A Salomaa - Theoretical Computer Science, 1998 - Elsevier
We introduce and investigate new methods to define parallel composition of words and
languages as well as of ω-words and ω-languages. The operation of parallel composition …

[图书][B] Algebraic theory of automata and languages

M Ito - 2004 - books.google.com
Although there are some books dealing with algebraic theory of automata, their contents
consist mainly of Krohn-Rhodes theory and related topics. The topics in the present book are …

[图书][B] L systems

L Kari, G Rozenberg, A Salomaa - 1997 - Springer
L systems are parallel rewriting systems which were originally introduced in 1968 to model
the development of multicellular organisms [L1]. The basic ideas gave rise to an abundance …

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 …

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 …