Open AccessJournal Article
On Characterizing Recursively Enumerable Languages by Insertion Grammars
TLDR
A positive answer to the question whether or not insertion grammars with weight at least 7 can characterize recursively enumerable languages can be improved is come up with by decreasing the weight of the insertion grammar used to 5.Abstract:
Insertion grammars have been introduced in [1] and their computational power has been studied in several places. In [7] it is proved that insertion grammars with weight at least 7 can characterize recursively enumerable languages (modulo a weak coding and an inverse morphism), and the question was formulated whether or not this result can be improved. In this paper, we come up with a positive answer to this question, by decreasing the weight of the insertion grammar used to 5. We also give a characterization of recursively enumerable languages in terms of right quotients of insertion languages.read more
Citations
More filters
Journal ArticleDOI
On the weight of universal insertion grammars
Lila Kari,Petr Sosík +1 more
TL;DR: In this article, the computational power of pure insertion grammars of weight 3 was studied and it was shown that a pure insertion grammar with weight 3 can characterize all recursively enumerable languages.
Complexity and modeling power of insertion-deletion systems
TL;DR: In this article, the authors consider a variante distribuida of the sistemas de insercion and borrado, in which reglas se separan entre un numero finito de nodos of a grafo.
Book ChapterDOI
Universal Matrix Insertion Grammars with Small Size
TL;DR: It is shown that pure MIS of size (3) (i.e., having ternary matrices inserting one symbol in two symbol context) can characterize all recursively enumerable languages.
On the Power of Insertion P Systems of Small Size
TL;DR: In this article, the authors investigate insertion systems of small size in the framework of P systems and show that if contexts of length two are permitted, then any recursively enumerable language can be generated.
Journal ArticleDOI
Universal insertion grammars of size two
TL;DR: The obtained results improve the descriptional complexity of insertion grammars and complete the picture of known results on insertion-deletion systems that are motivated from the DNA computing area.
References
More filters
Journal ArticleDOI
Tree adjunct grammars
TL;DR: A tree generating system called a tree adjunct grammar is described and its formal properties are studied relating them to the tree generating systems of Brainerd and Rounds and to the recognizable sets and local sets discussed by Thatcher.
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.
Book
Marcus Contextual Grammars
Gheorghe Paun,Gheorghe Pun +1 more
TL;DR: 1. Origin and Motivation, Formal Language Theory Prerequisites, and A Generalization: n-Contextual Grammars.
Book
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
TL;DR: Dna computing: new computing texts in theoretical computer science an eatcs series dna computing eolss author: dama international and rossano tavares the animal's christmas carol amazon s3 belair20e manual pvaz.