Descriptional Complexity of Splicing Systems

In this paper, the descriptional complexity of extended finite splicing systems is studied. These systems are known to generate exactly the class of regular languages. Upper and lower bounds are shown relating the size of these splicing systems, defined as the total length of the rules and the initial language of the system, to the size of their equivalent minimal nondeterministic finite automata (NFA). In addition, an accepting model of extended finite splicing systems is studied. Using this variant one can obtain systems which are more than polynomially more succinct than the equivalent NFA or generating extended finite splicing system.

[1]  Alica Kelemenová,et al.  Complexity of Normal Form Grammars , 1984, Theor. Comput. Sci..

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

[3]  Jozef Gruska.  Descriptional Complexity of Context-Free Languages , 1973, MFCS.

[4]  Andrei Paun.  Controlled H Systems of Small Radius , 1997, Fundam. Informaticae.

[5]  Gheorghe Paun,et al.  Computing by Splicing , 1996, Theor. Comput. Sci..

[6]  Tero Harju,et al.  Splicing semigroups of dominoes and DNA , 1991, Discret. Appl. Math..

[7]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[8]  Gheorghe Paun,et al.  Regular Extended H Systems are Computationally Universal , 1996, J. Autom. Lang. Comb..

[9]  Rudolf Freund,et al.  Test tube systems: when two tubes are enough , 1999, Developments in Language Theory.

[10]  Andrei Paun.  On Time-Varying H Systems , 1999, Bull. EATCS.

[11]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[12]  Andreas Malcher,et al.  Descriptional Complexity of Machines with Limited Resources , 2002, J. Univers. Comput. Sci..

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

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

[15]  Jean-Camille Birget,et al.  Intersection and Union of Regular Languages and State Complexity , 1992, Inf. Process. Lett..

[16]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[17]  Victor Mitrana,et al.  Solving SAT and HPP with Accepting Splicing Systems , 2006, PPSN.

[18]  Henning Fernau,et al.  Accepting Grammars and Systems via Context Condition Grammars , 1996, J. Autom. Lang. Comb..

[19]  Andreas Malcher,et al.  On two-way communication in cellular automata with a fixed number of cells , 2005, Theor. Comput. Sci..

[20]  Maurice Margenstern,et al.  Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations , 2002, DNA.

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