References
- Head , T. 1987 . Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors . Bulletin Mathematical Biology , 49 : 737 – 759 .
- Pixton , D. 1996 . Regularity of splicing languages . Discrete Applied Mathematics , 69 : 101 – 124 .
- Pǎun , Gh. 1996 . Regular extended H systems are computationally universal . Journal of Automata, Languages, and Combinatorics , 1 : 27 – 36 .
- Pǎaun , Gh. , Rozenberg , G. and Salomaa , A. 1998 . DNA Computing–-New Computing Paradigms , Berlin : Springer .
- Loos , R. 2006 . An alternative definition of splicing . Theoretical Computer Science , in press
- Harju , T. and Margenstern , N. Splicing systems for universal Turing machines. In: . Proceedings of the 10th International Meeting on DNA Based Computers, DNA10 . Edited by: Ferretti , C. pp. 149 – 158 . Berlin : Springer . Lecture Notes in Computer Science 3384
- Rozenberg , G. and Salomaa , A. 1997 . Handbook of Formal Languages , Vol. I , Berlin : Springer .
- Goode , E. and Pixton , D. 2004 . “ Splicing to the limit ” . In Aspects of Molecular Computing , Edited by: Jonoska , N. , Paun , Gh. and Rozenberg , G. 189 – 201 . Berlin : Springer . Lecture Notes in Computer Science 2950
- Pǎaun , Gh. , Rozenberg , G. and Salomaa , A. 1996 . Computing by splicing . Theoretical Computer Science , 168 : 321 – 336 .
- Margenstern , M. and Rogozhin , Y. 2001 . “ Time-varying distributed H systems of degree 1 generate all recursively enumerable languages ” . In Words, Semigroups, and Transductions , Edited by: Ito , M. , Paun , Gh. and Yu , S. 329 – 340 . Singapore : World Scientific .