On bonded sequential and parallel insertion systems

We introduce a new variant of insertion systems, namely bonded insertion systems. In such systems, words are not only formed by usual letters but also by bonds between letters. Words which can be inserted, have “free” bonds at their ends which control at which positions in a word they can be inserted (namely only there, where the bonds “fit”). Two kinds of bonded insertion systems are defined in this paper: so-called bonded sequential insertion systems and bonded parallel insertion systems. In a sequential system, there is only one word inserted at a time. In a parallel system, there is a word inserted at every possible position in parallel in one time step. We investigate the generative capacity of those two kinds and relate the families of generated languages to some families of the Chomsky hierarchy and to families of languages generated by Lindenmayer systems. Additionally, we investigate some closure properties.

[1]  Lila Kari,et al.  Block insertion and deletion on trajectories , 2011, Theor. Comput. Sci..

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

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

[4]  Lila Kari,et al.  Insertion and Deletion Closure of Languages , 1997, Theor. Comput. Sci..

[5]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[6]  Gheorghe Paun,et al.  On Parallel Deletions Applied to a Word , 1995, RAIRO Theor. Informatics Appl..

[7]  Lila Kari,et al.  Deletion operations: closure properties , 1994 .

[8]  Grzegorz Rozenberg,et al.  Introduction: DNA Computing in a Nutshell , 1998 .

[9]  Lila Kari,et al.  Shuffle and scattered deletion closure of languages , 2000, Theor. Comput. Sci..

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

[11]  Bianca Truthe,et al.  On bonded indian and uniformly parallel insertion systems and their generative power , 2017 .

[12]  Grzegorz Rozenberg,et al.  Developmental systems and languages , 1972, STOC.

[13]  Lila Kari,et al.  Aspects of shuffle and deletion on trajectories , 2005, Theor. Comput. Sci..

[14]  Gheorghe Paun,et al.  Deletion Sets , 1993, Fundam. Informaticae.

[15]  Lila Kari,et al.  Insertion and Deletion of Words: Determinism and Reversibility , 1992, MFCS.

[16]  Grzegorz Rozenberg,et al.  The mathematical theory of L systems , 1980 .

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

[18]  Lila Kari,et al.  Schema for Parallel Insertion and Deletion: Revisited , 2011, Int. J. Found. Comput. Sci..