scispace - formally typeset
Book ChapterDOI

Circular DNA and Splicing Systems

TLDR
It is shown that there is a difference in the regularity result of Culik and Harju between the linear and circular strings, which means that a conjecture of Head that the circular string language of a splicing system under an action on circular strings is regular is disproved.
Abstract
Circular strings representing DNA molecules and certain recombinant behaviour are formalized. Various actions of splicing schemes on linear and circular DNA molecules are examined. It is shown that there is a difference in the regularity result of Culik and Harju [1] between the linear and circular strings. A consequence of this result is that a conjecture of Head [4] that the circular string language of a splicing system under an action on circular strings is regular, when the set of initial circular strings is regular, is disproved.

read more

Citations
More filters
Journal ArticleDOI

Computing with molecules.

TL;DR: In a remarkable series of demonstrations, chemists, physicists and engineers have shown that individual molecules can conduct and switch electric current and store information, a field emerging around the premise that it is possible to build individual molecules that can perform functions identical or analogous to those of the transistors, diodes, conductors and other key components of today's microcircuits.
Journal ArticleDOI

Regularity of splicing languages

TL;DR: A simpler proof of the fundamental fact that the closure of a regular language under iterated splicing using a finite number of splicing rules is again regular is given.
Book ChapterDOI

Language theory and molecular genetics: generative mechanisms suggested by DNA recombination

TL;DR: The stimulus for the development of the theory presented in this chapter is the string behaviors exhibited by the group of molecules often referred to collectively as the informational macromolecules, and the splicing rule concept is the foundation for the present chapter.
Journal ArticleDOI

The evolution of cellular computing: nature’s solution to a computational problem

TL;DR: Adleman's elegant solution to a seven-city directed Hamiltonian path problem using DNA launched the new field of DNA computing, which in a few years has grown to international scope as discussed by the authors.
References
More filters
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.
Journal ArticleDOI

Splicing semigroups of dominoes and DNA

TL;DR: The main result is that in the case of alphabetic dominoes the splicing semigroup generated from an initial regular set is again regular, implying positive solution of two open problems stated by Head, namely the regularity of splicing systems and the decidability of their membership problem.
Book ChapterDOI

Splicing Schemes and DNA

TL;DR: Previous work on splicing systems is reviewed and problems are suggested that concern the generative capacities of splicing schemes acting on both linear and circular strings.
Journal ArticleDOI

On equal matrix languages

TL;DR: A generative grammar called equal matrix grammar which generates a class which meets both context-sensitive and context-free languages is defined and the formal power series generated by context- Free Grammars is extended to grammars of this system.
Journal ArticleDOI

Splicing systems and regularity

TL;DR: A direct and constructive proof is given that every regular language is the homomorphic image of a splicing language as defined by Head.
Related Papers (5)