Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems

Henning Fernau
  • Fonction : Auteur
  • PersonId : 857693
Lakshmanan Kuppusamy
  • Fonction : Auteur
  • PersonId : 917459
Indhumathi Raman
  • Fonction : Auteur
  • PersonId : 1022737

Résumé

We consider graph-controlled insertion-deletion systems and prove that the systems with sizes (i) (3; 1, 1, 1; 1, 0, 1), (ii) $$(3;1,1,1;1,1,0)$$ and (iii) (2; 2, 0, 0; 1, 1, 1) are computationally complete. Moreover, graph-controlled insertion-deletion systems simulate linear languages with sizes (2; 2, 0, 1, 1, 0, 0), (2; 2, 1, 0; 1, 0, 0), (3; 1, 0, 1; 1, 0, 0), or (3; 1, 1, 0; 1, 0, 0). Simulations of metalinear languages are also studied. The parameters in the size $$(k;n,i',i'';m,j',j'')$$ of a graph-controlled insertion-deletion system denote (from left to right) the maximum number of components, the maximal length of the insertion string, the maximal length of the left context for insertion, the maximal length of the right context for insertion; a similar list of three parameters concerning deletion follows.
Fichier principal
Vignette du fichier
416473_1_En_9_Chapter.pdf (468.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01633956 , version 1 (13-11-2017)

Licence

Paternité

Identifiants

Citer

Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman. Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.111-125, ⟨10.1007/978-3-319-41114-9_9⟩. ⟨hal-01633956⟩
104 Consultations
116 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More