Journal ArticleDOI
DNA computing, sticker systems, and universality ?
TLDR
Several types of sticker systems are shown to characterize (modulo a weak coding) the regular languages, hence the power of finite automata, and one variant is proven to be equivalent to Turing machines.Abstract:
We introduce the sticker systems, a computability model, which is an abstraction of the computations using the Watson-Crick complementarity as in Adleman's DNA computing experiment, [1]. Several types of sticker systems are shown to characterize (modulo a weak coding) the regular languages, hence the power of finite automata. One variant is proven to be equivalent to Turing machines. Another one is found to have a strictly intermediate power.read more
Citations
More filters
Journal ArticleDOI
A programming language for composable DNA circuits.
Andrew Phillips,Luca Cardelli +1 more
TL;DR: A programming language for designing and simulating DNA circuits in which strand displacement is the main computational mechanism and includes basic elements of sequence domains, toeholds and branch migration, and assumes that strands do not possess any secondary structure is presented.
Journal ArticleDOI
Efficient DNA sticker algorithms for NP-complete graph problems
TL;DR: DNA algorithms based on the sticker model are provided to compute all k-cliques, independent k-sets, Hamiltonian paths, and Steiner trees with respect to a given edge or vertex set in an undirected graph.
Journal ArticleDOI
Sticker systems
Gheorghe Paun,Grzegorz Rozenberg +1 more
TL;DR: Characterizations of regular, linear, and recursively enumerable languages are obtained in this framework of sticker systems, an abstraction of the way that the WatsonCrick complementarity is used in DNA computing.
Journal ArticleDOI
Evolution and observation: a non-standard way to generate formal languages
Matteo Cavaliere,Peter Leupold +1 more
TL;DR: P/O systems are introduced to generate any recursively enumerable language and a class of languages between the context-free and context-sensitive ones is obtained.
Journal ArticleDOI
Superposition Based on Watson–Crick-Like Complementarity
TL;DR: A useful result is obtained by showing that unrestricted iteration of the superposition operation, where the "parents" in a subsequent iteration can be any words produced during any preceding iteration step, is equivalent to restricted iteration, where at each step one parent must be a word from the initial language.
References
More filters
Journal ArticleDOI
Molecular computation of solutions to combinatorial problems
TL;DR: This experiment demonstrates the feasibility of carrying out computations at the molecular level by solving an instance of the directed Hamiltonian path problem with standard protocols and enzymes.
Book
Regulated rewriting in formal language theory
Jrgen Dassow,Gheorghe Paun +1 more
TL;DR: This book presents 25 different regulating mechanisms by definitions, examples and basic facts, especially concerning hierarchies, as well as selective substitution grammars as one common generalization.
Journal ArticleDOI
Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors.
TL;DR: This study initiates the formal analysis of the generative power of recombinational behaviors in general by means of a new generative formalism called a splicing system and a significant subclass of these languages, which are shown to coincide with a class of regular languages which have been previously studied in other contexts: the strictly locally testable languages.