A. Alhazov, R. Freund, S. Ivanov & S. Verlan (2022):
Regulated Insertion-Deletion Systems.
Journal of Automata, Languages and Combinatorics 27(1-3),
pp. 15–45,
doi:10.25596/jalc-2022-015.
R. Benne (1993):
RNA Editing: The Alteration of Protein Coding Sequences of RNA.
Ellis Horwood.
H. Fernau, L. Kuppusamy & I. Raman (2017):
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes.
Theoretical Computer Science 682,
pp. 100–121,
doi:10.1016/j.tcs.2017.01.019.
H. Fernau, L. Kuppusamy & I. Raman (2019):
On path-controlled insertion-deletion systems.
Acta Informatica 56(1),
pp. 35–59,
doi:10.1007/s00236-018-0312-2.
H. Fernau, L. Kuppusamy & I. Raman (2021):
On the generative capacity of matrix insertion-deletion systems of small sum-norm.
Natural Computing 20(4),
pp. 671–689,
doi:10.1007/s11047-021-09866-y.
R. Freund, M. Kogler, Y. Rogozhin & S. Verlan (2010):
Graph-Controlled Insertion-Deletion Systems.
In: I. McQuillan & G. Pighizzini: Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS,
EPTCS 31,
pp. 88–98,
doi:10.4204/EPTCS.31.11.
V. Geffert (1991):
Normal forms for phrase-structure grammars.
RAIRO Informatique théorique et Applications/Theoretical Informatics and Applications 25,
pp. 473–498,
doi:10.1051/ita/1991250504731.
S. Ivanov & S. Verlan (2014):
About One-Sided One-Symbol Insertion-Deletion P Systems.
In: A. Alhazov, S. Cojocaru, M. Gheorghe, Y. Rogozhin, G. Rozenberg & A. Salomaa: Membrane Computing - 14th Int. Conf., CMC 2013,
LNCS 8340.
Springer,
pp. 225–237,
doi:10.1007/978-3-642-54239-8_16.
S. Ivanov & S. Verlan (2017):
Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems.
Fundamenta Informaticae 155(1-2),
pp. 163–185,
doi:10.3233/FI-2017-1580.
L. Kari, Gh. Păun, G. Thierrin & S. Yu (1999):
At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems.
In: Discrete Mathematics and Theretical Computer Science,
DIMACS 48.
AMS,
pp. 329–338,
doi:10.1090/dimacs/048/23.
L. Kari & G. Thierrin (1996):
Contextual Insertions/Deletions and Computability.
Information and Computation 131(1),
pp. 47–61,
doi:10.1006/inco.1996.0091.
A. Krassovitskiy, Y. Rogozhin & S. Verlan (2008):
Further Results on Insertion-Deletion Systems with One-Sided Contexts.
In: C. Martín-Vide, F. Otto & H. Fernau: Language & Automata Theory & Applications, LATA,
LNCS 5196.
Springer,
pp. 333–344,
doi:10.1007/978-3-540-88282-4_31.
S. N. Krishna & R. Rama (2002):
Insertion-Deletion P Systems.
In: N. Jonoska & N. C. Seeman: DNA Computing, 7th Int. Workshop on DNA-Based Computers, 2001,
LNCS 2340.
Springer,
pp. 360–370,
doi:10.1007/3-540-48017-X_34.
S. Marcus (1969):
Contextual grammars.
Revue Roumaine de Mathématiques Pures et Appliquées 14,
pp. 1525–1534.
A. Matveevici, Y. Rogozhin & S. Verlan (2007):
Insertion-Deletion Systems with One-Sided Contexts.
In: MCU,
LNCS 4664.
Springer,
pp. 205–217,
doi:10.1007/978-3-540-74593-8_18.
Gh. Păun (1997):
Marcus Contextual Grammars.
Studies in Linguistics and Philosophy 67.
Kluwer,
doi:10.1007/978-94-015-8969-7_4.
Gh. Păun, G. Rozenberg & A. Salomaa (1998):
DNA Computing: New Computing Paradigms.
Springer,
doi:10.1007/978-3-662-03563-4.
I. Petre & S. Verlan (2012):
Matrix insertion-deletion systems.
Theoretical Computer Science 456,
pp. 80–88,
doi:10.1016/j.tcs.2012.07.002.
A. Takahara & T. Yokomori (2003):
On the computational power of insertion-deletion systems.
Natural Computing 2(4),
pp. 321–336,
doi:10.1023/B:NACO.0000006769.27984.23.
S. Verlan (2010):
Recent Developments on Insertion-Deletion Systems.
The Computer Science Journal of Moldova 18(2),
pp. 210–245.
eptcs@eptcs.org