Universal insertion grammars of size two - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2020

Universal insertion grammars of size two

Résumé

In this paper, we show that pure insertion grammars of size 2 (i.e., inserting two symbols in a left and right context, each consisting of two symbols) 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 LOC(2) language, or an intersection with a LOC(2) language and a weak coding. 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.
Fichier principal
Vignette du fichier
purins222.pdf (374.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03550102 , version 1 (31-01-2022)

Identifiants

Citer

Sergey Verlan, Henning Fernau, Lakshmanan Kuppusamy. Universal insertion grammars of size two. Theoretical Computer Science, 2020, 843, pp.153-163. ⟨10.1016/j.tcs.2020.09.002⟩. ⟨hal-03550102⟩

Collections

LACL UPEC
11 Consultations
56 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More