A Proof of Regularity for Finite Splicing

We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.

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

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

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

[4]  Dennis Pixton,et al.  Splicing in abstract families of languages , 2000, Theor. Comput. Sci..

[5]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[6]  David I. Lewin,et al.  DNA computing , 2002, Comput. Sci. Eng..

[7]  Vincenzo Manca.  On some forms of splicing , 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

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

[9]  Cristian S. Calude,et al.  Finite Versus Infinite , 2000, Discrete Mathematics and Theoretical Computer Science.

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

[11]  F. Young.  Biochemistry , 1955, The Indian Medical Gazette.

[12]  Tero Harju,et al.  Dominoes and the Regularity of DNS Splicing Languages , 1989, ICALP.

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

[14]  Cristian S. Calude,et al.  Finite Versus Infinite: Contributions to an Eternal Dilemma , 2000 .

[15]  Vincenzo Manca.  Splicing Normalization and Regularity , 2000, Finite Versus Infinite.