Regulated insertion-deletion systems

Artiom Alhazov (1) , Rudolf Freund (2) , Sergiu Ivanov (3) , Sergey Verlan (4)

1 Vladimir Andrunachievici Institute of Mathematics and Computer Science
2 Faculty of Informatics
3 IBISC - Informatique, BioInformatique, Systèmes Complexes
4 LACL - Laboratoire d'Algorithmique Complexité et Logique

Insertion and deletion operations appear in several areas of theoretical computer science, as well as in linguistics and DNA computing. In this paper, we investigate insertion and deletion within the regulated rewriting framework, i. e., the rule application is subject to additional constraints. We consider various regulation mechanisms already considered or not in the area of insertion-deletion systems. Beside recalling existing results, we present a series of new results related to the use of prescribed sequences, time-varying and cooperating distributed (CD) controls.

Mots clés: Cooperating distributed grammar system; Graph-controlled grammar; Insertion-deletion; Matrix grammar; Regulated rewriting; Time-varying grammar

Domaines: Théorie et langage formel [cs.FL]; Bio-informatique [q-bio.QM]

Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan. Regulated insertion-deletion systems. Journal of Automata, Languages and Combinatorics, 2022, 27, pp.15--45. ⟨10.25596/jalc-2022-015⟩. ⟨hal-03766387⟩