Formal properties of PA-matching
TLDR
All closure properties of families in the Chomksy hierarchy under both non-iterated and iterated PA-matching and overlapping operations are settled.About:
This article is published in Theoretical Computer Science.The article was published on 2001-07-06 and is currently open access. It has received 11 citations till now. The article focuses on the topics: Cone (formal languages) & Abstract family of languages.read more
Citations
More filters
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.
Journal ArticleDOI
A Formal Language Model of DNA Polymerase Enzymatic Activity
TL;DR: The canonic inverse of directed extension is used in order to obtain the optimal solution the minimal primer language to the question under what conditions can a given language of target strings be generated from a given template language when the primer language is unknown.
Book ChapterDOI
Iterated Transductions and Efficient Learning from Positive Data: A Unifying View
TL;DR: This paper gives a set of language classes each of which is efficiently learnable in the limit from positive data, and proposes a framework for defining language classes based on iterated transductions.
Formal models of the extension activity of DNA polymerase enzymes
TL;DR: The question of finding necessary and sufficient conditions for a given language of target strings to be generated from a given template language when the primer language is unknown is answered and the canonic inverse of directed extension is used in order to obtain the optimal solution to this question.
Book ChapterDOI
Some Remarks on Superposition Based on Watson-Crick-Like Complementarity
TL;DR: The iterated superposition of a regular language is regular and the restricted superposition distance between a word and a language is defined and it is proved that this distance can be computed in time ${\mathcal O}(n^2f(n)$ in the RAM model.
References
More filters
BookDOI
Handbook of Formal Languages
Grzegorz Rozenberg,Arto Salomaa +1 more
TL;DR: This first handbook of formal languages gives a comprehensive up-to-date coverage of all important aspects and subareas of the field.
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.
Book
DNA Computing: New Computing Paradigms
TL;DR: This book starts with an introduction to DNA computing, exploring the power of complementarity, the basics of biochemistry, and language and computation theory, and brings the reader to the most advanced theories develop thus far in this emerging research area.
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.
Related Papers (5)
Growing context-sensitive languages and Church-Rosser languages
Gerhard Buntrock,Friedrich Otto +1 more