Sciweavers

TCS
2008

On the weight of universal insertion grammars

13 years 3 months ago
On the weight of universal insertion grammars
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achieved by either applying an inverse morphism and a weak coding, or a left (right) quotient with a regular language. A consequences for the closure properties of insertion grammars are shown. We also study an application in DNA computing and improve some known results concerning the power of insertion-deletion DNA systems.
Lila Kari, Petr Sosík
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TCS
Authors Lila Kari, Petr Sosík
Comments (0)