Restricted use of the splicing operationFootnote¹

Research supported by the Academy of Finland. project 11281, and the ESPRIT Basic Research Working Group ASMICS 11.

References

• Baker , B. S. and Book , R. V. 1974 . Reversal-bounded multipushdown machines . J. Comput. Systems Sci. , 8 : 315 – 332 .
   Google Scholar
• Collado-Vides , J. 1991 . The search for a grammatical theory of gene regulation is formally justified by showing the inadequacy of context-free grammars . CABIOS , 7 : 321 – 326 .
   PubMedGoogle Scholar
• Culik , K. and Harju , T. 1991 . Splicing semigroups of dominoes and DNA . Discrete Appl. Math. , 31 : 261 – 277 .
   Web of Science ®Google Scholar
• Dassow , J. and Pâun , Gh. 1989 . Regulated Rewriting in Formal Language Theory , Berlin, Heidelberg, New York : Springer-Verlag .
   Google Scholar
• Denninghoff , K. L. and Gatterdam , R. W. 1989 . On the undecidability of splicing systems . Intern. J. Computer Math. , 27 : 133 – 145 .
   Web of Science ®Google Scholar
• Gatterdam , R. W. 1989 . Splicing systems and regularity . Intern. J. Computer Math. , 31 : 63 – 67 .
   Web of Science ®Google Scholar
• Ginsburg , S. 1989 . Algebraic and Automata-Theoretic Properties of Formal Languages , Amsterdam : North-Holland .
   Google Scholar
• Head , T. 1987 . Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors . Bull. Math. Biology , 49 : 737 – 759 .
   PubMed Web of Science ®Google Scholar
• Head , T. 1992 . “ Splicing schemes and DNA ” . In Lindenmayer Systems; Impacts on Theoretical Computer Science and Developmental Biology , Edited by: Rozenberg , G. and Salomaa , A. 371 – 383 . Berlin : Springer-Verlag .
   Google Scholar
• Ibarra , O. 1970 . Simple matrix grammars . Inform. Control , 17 : 359 – 394 .
   Google Scholar
• Latteux , M. , Leguy , B. and Ratoandromanana , B. 1985 . The family of one-counter languages is closed under quotient . Acta Informatica , 22 : 579 – 588 .
   Google Scholar
• Mateescu A. Pāun Gh. Rozenberg G. Salomaa A. Simple splicing systems 1995 submitted
   Google Scholar
• Mitrana V. Crossover systems: a language-theoretic approach to DNA recombinations 1995 manu-script
   Google Scholar
• Pāun Gh. On the splicing operation Discrete Appl. Math. to appear
   Google Scholar
• Pāun Gh. On the power of the splicing operation Intern. J. Computer Math. to appear
   Google Scholar
• Pāun Gh. Rozenberg G. Salomaa A. Computing by splicing 1995 submitted
   Google Scholar
• Pāun , Gh. and Salomaa , A. 1995 . Thin and slender languages . Discrete Appl. Math. , 61 : 257 – 270 .
   Google Scholar
• Pixton , D. and Pixton , D. 1995 . “ Linear and circular splicing systems ” . In First IEEE Symp. Intelligence in Neural and Biological Systems 181 – 188 . Washington
   Google Scholar
• Pixton D. Context-free splicing systems 1994 manuscript
   Google Scholar
• Rozenberg , G. and Salomaa , A. 1980 . The Mathematical Theory of L Systems , New York : Academic Press .
   Google Scholar
• Rozenberg , G. and Salomaa , A. , eds. The Handbook of Formal Languages
   Google Scholar
• Salomaa , A. 1973 . Formal Languages , New York : Academic Press .
   Google Scholar