Unavoidable Sets and Regularity of Languages Generated by (1, 3)-Circular Splicing Systems

Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. They are defined by a finite alphabet A, an initial set I of circular words and a set R of rules. Berstel, Boasson and Fagnot (2012) showed that if I is context-sensitive and R is finite, then the generated language is context-sensitive. Moreover, when I is context-free and the rules are of a simple type (alphabetic splicing systems) the generated language is context-free. In this paper, we focus on the still unknown relations between regular languages and circular splicing systems with a finite initial set and a finite set of rules represented by a pair of letters ((1,3)-CSSH systems). We prove necessary conditions for (1,3)-CSSH systems generating regular languages. We introduce a special class of (1,3)-CSSH systems, hybrid systems, and we prove that if a hybrid system generates a regular language, then the full linearization of its initial set is unavoidable, a notion introduced by Ehrenfeucht, Haussler and Rozenberg (1983). Hybrid systems include two previously considered classes of (1,3)-CSSH systems: complete systems and transitive marked systems. Unavoidability of the full linearization of the initial set has been previously proved to characterize complete systems generating regular languages whereas transitive marked systems generating regular languages are characterized by a property of the set of rules. We conjecture that this property of the set of rules, along with unavoidability of the full linearization of the initial set, still characterizes hybrid systems generating regular languages.

[1]  Tom Head.  CIRCULAR SUGGESTIONS FOR DNA COMPUTING , 2000 .

[2]  Rani Siromoney,et al.  Circular DNA and Splicing Systems , 1992, ICPIA.

[3]  Christian Choffrut,et al.  On extendibility of unavoidable sets , 1984, Discret. Appl. Math..

[4]  K. G. Subramanian,et al.  On Some Classes of Splicing Languages , 2004, Aspects of Molecular Computing.

[5]  M. Lothaire.  Algebraic Combinatorics on Words , 2002 .

[6]  Paola Bonizzoni,et al.  Splicing Systems from Past to Future: Old and New Challenges , 2015, Discrete Mathematics and Computer Science.

[7]  Tom Head,et al.  Splicing Schemes and DNA , 1992 .

[8]  Katsushi Inoue,et al.  Parallel Image Analysis , 1992, Lecture Notes in Computer Science.

[9]  Marcel Paul Schützenberger,et al.  On the Synchronizing Properties of Certain Prefix Codes , 1964, Inf. Control..

[10]  Gheorghe Paun,et al.  Language Theory and Molecular Genetics: Generative Mechanisms Suggested by DNA Recombination , 1997, Handbook of Formal Languages.

[11]  Paola Bonizzoni,et al.  On the power of circular splicing , 2005, Discret. Appl. Math..

[12]  Jean Berstel,et al.  Splicing systems and the Chomsky hierarchy , 2012, Theor. Comput. Sci..

[13]  Paola Bonizzoni,et al.  On the regularity of circular splicing languages: a survey and new developments , 2010, Natural Computing.

[14]  Dennis Pixton,et al.  Regularity of Splicing Languages , 1996, Discret. Appl. Math..

[15]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .

[16]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[17]  T. Head.  Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. , 1987, Bulletin of mathematical biology.

[18]  David Haussler,et al.  On Regularity of Context-Free Languages , 1983, Theor. Comput. Sci..

[19]  Grzegorz Rozenberg,et al.  Aspects of Molecular Computing , 2004, Lecture Notes in Computer Science.

[20]  Gabriele Fici,et al.  A characterization of regular circular languages generated by marked splicing systems , 2009, Theor. Comput. Sci..

[21]  Laurent Rosaz,et al.  Inventories of Unavoidable Languages and the Word-Extension Conjecture , 1998, Theor. Comput. Sci..

[22]  Paola Bonizzoni,et al.  A characterization of (regular) circular languages generated by monotone complete splicing systems , 2010, Theor. Comput. Sci..

[23]  M. Gromov,et al.  Pattern Formation In Biology, Vision And Dynamics , 2000 .

[24]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[25]  Manfred Kudlek.  On Languages of Cyclic Words , 2004, Aspects of Molecular Computing.

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

[27]  Paola Bonizzoni,et al.  Circular splicing and regularity , 2004, RAIRO Theor. Informatics Appl..