Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems

[1]  Sergiu Ivanov,et al.  On the Power and Universality of Biologically-inspired Models of Computation. (Étude de la puissance d'expression et de l'universalité des modèles de calcul inspirés par la biologie) , 2015 .

[2]  Alexander Krassovitskiy,et al.  Complexity and modeling power of insertion-deletion systems , 2011 .

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

[4]  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).

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

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

[7]  Sergiu Ivanov,et al.  Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States , 2015, MCU.

[8]  Rudolf Freund,et al.  Graph-Controlled Insertion-Deletion Systems , 2010, DCFS.

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

[10]  Takashi Yokomori,et al.  On the computational power of insertion-deletion systems , 2004, Natural Computing.

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

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

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

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

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

[16]  John Cocke,et al.  Universality of Tag Systems with P = 2 , 1964, JACM.

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

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

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

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

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

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

[23]  Sergiu Ivanov,et al.  On the Lower Bounds for Leftist Insertion-Deletion Languages , 2015 .