scispace - formally typeset
Journal ArticleDOI

Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors.

Tom Head
- 01 Jan 1987 - 
- Vol. 49, Iss: 6, pp 737-759
Reads0
Chats0
TLDR
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.
About
This article is published in Bulletin of Mathematical Biology.The article was published on 1987-01-01. It has received 588 citations till now. The article focuses on the topics: Formal language.

read more

Citations
More filters
Journal ArticleDOI

Computing with Membranes

TL;DR: It is proved that the P systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice.
Journal ArticleDOI

Solution of a 20-Variable 3-SAT Problem on a DNA Computer

TL;DR: A 20-variable instance of the NP-complete three-satisfiability (3-SAT) problem was solved on a simple DNA computer and may be the largest yet solved by nonelectronic means.
Journal ArticleDOI

A guide to membrane computing

TL;DR: The present paper presents the basic ideas of computing with membranes and some fundamental properties (mostly concerning the computational power and efficiency) of P systems of various types.
Journal ArticleDOI

The language of genes

TL;DR: Many techniques used in bioinformatics, even if developed independently, may be seen to be grounded in linguistics, and further interweaving of these fields will be instrumental in extending the understanding of the language of life.
Journal ArticleDOI

Biomolecular computing systems: principles, progress and potential

TL;DR: Rational design and engineering of biological computing systems can greatly enhance the authors' ability to study and to control biological systems and potential applications include tissue engineering and regeneration and medical treatments.
References
More filters
Book

Introduction to Automata Theory, Languages, and Computation

TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book

Counter-Free Automata

TL;DR: A particular class of finite-state automata, christened by the authors "counter-free," is shown here to behave like a good actor: it can drape itself so thoroughly in the notational guise and embed itself so deeply in the conceptual character of several quite different approaches to automata theory that on the surface it is hard to believe that all these roles are being assumed by the same class.
Book

Computation and automata

TL;DR: This chapter discusses models of computation, Rudiments of language theory, and trends in automata and language theory as well as describing the development of Turing machines and recursive functions in the 1990s.