On the Lower Bounds for Leftist Insertion-Deletion Languages

This article investigates languages generated by insertiondeletion systems that insert or delete one symbol using only a left context. We show that if the context of insertion or deletion is greater than one, then the corresponding families are all equal to each other and properly include the family of regular languages. We also show that the obtained family contains non-context-free languages.

[1]  Lila Kari,et al.  On Insertion and Deletion in Formal Languages , 1991 .

[2]  Gheorghe Paun,et al.  Marcus Contextual Grammars , 1994, Bull. EATCS.

[3]  Yurii Rogozhin,et al.  Further Results on Insertion-Deletion Systems with One-Sided Contexts , 2008, LATA.

[4]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[5]  Lila Kari,et al.  Contextual Insertions/Deletions and Computability , 1996, Inf. Comput..

[6]  Yurii Rogozhin,et al.  Computational power of insertion–deletion (P) systems with rules of size two , 2011, Natural Computing.

[7]  Rajeev Motwani,et al.  On the decidability of accessibility problems (extended abstract) , 2000, STOC '00.

[8]  Tomasz Jurdzi.  Leftist Grammars Are Non-primitive Recursive , 2008 .

[9]  Yurii Rogozhin,et al.  Insertion-Deletion Systems with One-Sided Contexts , 2007, MCU.

[10]  Warren D. Smith.  DNA computers in vitro and vivo , 1995, DNA Based Computers.

[11]  Rani Siromoney,et al.  Circular contextual insertions/deletions with applications to biomolecular computation , 1999, 6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268).

[12]  Gheorghe Paun,et al.  At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems , 1997, DNA Based Computers.

[13]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[14]  Solomon Marcus,et al.  Contextual Grammars , 1969, COLING.

[15]  Artiom Alhazov,et al.  Small Size Insertion and Deletion Systems , 2010, Scientific Applications of Language Methods.

[16]  Henning Fernau,et al.  Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity , 2017, DCFS.

[17]  David Henry Haussler.  Insertion and iterated insertion as operations on formal languages , 1982 .

[18]  Ion Petre,et al.  Matrix insertion-deletion systems , 2010, Theor. Comput. Sci..

[19]  Krzysztof Lorys,et al.  Leftist Grammars and the Chomsky Hierarchy , 2005, FCT.

[20]  Gheorghe Paun,et al.  Context-free insertion-deletion systems , 2005, Theor. Comput. Sci..

[21]  Sergiu Ivanov,et al.  About One-Sided One-Symbol Insertion-Deletion P Systems , 2013, Int. Conf. on Membrane Computing.

[22]  Sergiu Ivanov,et al.  Random Context and Semi-conditional Insertion-deletion Systems , 2011, Fundam. Informaticae.

[23]  David Haussler,et al.  Insertion languages , 1983, Inf. Sci..

[24]  Takashi Yokomori,et al.  On the Computational Power of Insertion-Deletion Systems , 2002, DNA.

[25]  Sergey Verlan,et al.  On minimal context-free insertion-deletion systems , 2005, DCFS.

[26]  R. Garrett,et al.  RNA Editing: The alteration of protein coding sequences of RNA : Edited by R. Benne; Ellis Horwood, Chichester, 1993. 196 pp. $ 67.95. ISBN 0-13-782558-7 , 1994 .

[27]  Tomasz Jurdziski,et al.  On complexity of grammars related to the safety problem , 2007 .

[28]  R. Benne,et al.  RNA Editing: The Alteration of Protein Coding Sequences of RNA , 1993 .

[29]  Mark Daley,et al.  Regulated RNA rewriting: Modelling RNA editing with guided insertion , 2007, Theor. Comput. Sci..