A. Alhazov, A. Krassovitskiy, Y. Rogozhin, and S. Verlan, P systems with minimal insertion and deletion, Theoretical Computer Science, vol.412, issue.1-2, pp.136-144, 2011.
DOI : 10.1016/j.tcs.2010.08.025
URL : https://hal.archives-ouvertes.fr/hal-01352378

R. Benne, RNA Editing, 1993.
DOI : 10.1128/9781555818296.ch20

F. Biegler, M. J. Burrell, and M. Daley, Regulated RNA rewriting: Modelling RNA editing with guided insertion, Theoretical Computer Science, vol.387, issue.2, pp.103-112, 2007.
DOI : 10.1016/j.tcs.2007.07.030
URL : https://doi.org/10.1016/j.tcs.2007.07.030

N. Chomsky and M. P. Schützenberger, The algebraic theory of context-free languages, Studies in Logic and the Foundations of Mathematics, pp.118-161, 1970.

R. Freund, M. Kogler, Y. Rogozhin, and S. Verlan, Graph-Controlled Insertion-Deletion Systems, Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS, pp.88-98, 2010.
DOI : 10.4204/EPTCS.31.11
URL : https://hal.archives-ouvertes.fr/hal-01352317

V. Geffert, How to generate languages using only two pairs of parentheses, Journal of Information Processing and Cybernetics EIK, vol.27, issue.56, pp.303-315, 1991.

D. Haussler, Insertion languages, Information Sciences, vol.31, issue.1, pp.77-89, 1983.
DOI : 10.1016/0020-0255(83)90023-3

S. Ivanov and S. Verlan, About One-Sided One-Symbol Insertion-Deletion P Systems, Membrane Computing -14th International Conference, pp.225-237, 2013.
DOI : 10.1007/978-3-642-54239-8_16
URL : https://hal.archives-ouvertes.fr/hal-01161704

S. Ivanov and S. Verlan, Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States, Machines, Computations , and Universality -7th International Conference, pp.79-93, 2015.
DOI : 10.1007/978-3-319-23111-2_6
URL : https://hal.archives-ouvertes.fr/hal-01352286

L. Kari, On insertion and deletion in formal languages, 1991.

L. Kari and G. Thierrin, Contextual Insertions/Deletions and Computability, Information and Computation, vol.131, issue.1, pp.47-61, 1996.
DOI : 10.1006/inco.1996.0091
URL : https://doi.org/10.1006/inco.1996.0091

A. Krassovitskiy, Y. Rogozhin, and S. Verlan, Computational power of insertion???deletion (P) systems with rules of size two, Natural Computing, vol.12, issue.1/2, pp.835-852, 2011.
DOI : 10.1007/978-94-015-8969-7
URL : https://hal.archives-ouvertes.fr/hal-01352311

L. Kuppusamy, A. Mahendran, and S. N. Krishna, Matrix Insertion-Deletion Systems for Bio-Molecular Structures, Distributed Computing and Internet Technology -7th International Conference, ICD- CIT, pp.301-312, 2011.
DOI : 10.1016/S0304-3975(98)00090-5

L. Kuppusamy and R. Rama, On the power of tissue P systems with insertion and deletion rules, Pre-Proc. of Workshop on Membrane Computing, pp.304-318, 2003.

M. Kutrib and A. Malcher, Finite turns and the regular closure of linear context-free languages, Discrete Applied Mathematics, vol.155, issue.16, pp.2152-2164, 2007.
DOI : 10.1016/j.dam.2007.05.021

M. Margenstern, . Gh, Y. P?un, S. Rogozhin, and . Verlan, Context-free insertion???deletion systems, Theoretical Computer Science, vol.330, issue.2, pp.339-348, 2005.
DOI : 10.1016/j.tcs.2004.06.031
URL : https://hal.archives-ouvertes.fr/hal-01352350

I. Petre and S. Verlan, Matrix insertion???deletion systems, Theoretical Computer Science, vol.456, pp.80-88, 2012.
DOI : 10.1016/j.tcs.2012.07.002
URL : https://hal.archives-ouvertes.fr/hal-01352302

. Gh, G. P?un, A. Rozenberg, and . Salomaa, DNA Computing: New Computing Paradigms, 1998.

A. Takahara and T. Yokomori, On the computational power of insertion-deletion systems, Natural Computing, vol.2, issue.4, pp.321-336, 2003.
DOI : 10.1023/B:NACO.0000006769.27984.23

S. Verlan, Recent developments on insertion-deletion systems, The Computer Science Journal of Moldova, vol.18, issue.2, pp.210-245, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01352384