Generalized P-systems with splicing and cutting/recombination

Grammars

Volumn 2, Issue 3, 1999, Pages 189-199

  Freund, Rudolf ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Molecular computing; P systems; Splicing

Indexed keywords

EID: 0005162238     PISSN: 13861793     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. Adleman, L.M. Molecular computation of solutions to combinatorial problems. Science, 226: 1021-1024, 1999.
2. Berry, G. and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96: 217-248, 1992.
3. Csuhaj-Varjú, E., R. Freund, L. Kari, and Gh. Pǎun. DNA computing based on splicing: Universality results. In L. Hunter and T. Klein, editors, Proc PSB'96, 179-190. World Scientific, 1996.
4. Csuhaj-Varjú, E., L. Kari, and Gh. Pǎun. Test tube distributed systems based on splicing. Computers and Artificial Intelligence, 15(2): 211-232, 1996.
5. Dassow, J. and Gh. Pǎun. Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin, 1989.
6. Dassow, J. and Gh. Pǎun. On the power of membrane computing. TUCS Research Report No. 217, Turku, Finland, 1998.
7. Freund, R. Generalized P-systems. In G. Ciobanu and Gh. Pǎun (editors), Proc 12th International Symposium, FCT'99, Iaşi, Romania, August 30-September 3, 1999. Lecture Notes in Computer Science 1684, Springer-Verlag Berlin Heidelberg New York, 1999.
8. Freund, R., E. Csuhaj-Varjú, and F. Wachtler. Test tube systems with cutting/recombination operations. Proc PSB'97, 163-174. World Scientific, 1997.
9. Freund, R. and F. Freund. Test tube systems or how to bake a DNA cake. Acta Cybernetica, 12: 445-459, 1996.
10. Freund, R. and F. Freund. Test tube systems: When two tubes are enough. Proc DLT'99, Aachen, Germany, 1999.
11. Freund, R., L. Kari, and Gh. Pǎun. DNA computing based on splicing: The existence of universal computers. Theory of Computing Systems, 32: 69-112, 1999.
12. Freund, R. and F. Wachtler. Universal systems with operations related to splicing. Computers and Artificial Intelligence, 15(4): 273-294, 1996.
13. Pǎun, Gh. Regular extended H systems are computationally universal. J. Automata, Languages and Combinatorics, 1(1): 27-37, 1996.
14. Pǎun, Gh. Computing with membranes. TUCS Research Report No. 208, Turku, Finland, 1998.
15. Pǎun, Gh. Computing with membranes: an introduction. Bulletin EATCS, 67: 139-152, 1999.
16. Pǎun, Gh., G. Rozenberg, and A. Salomaa. DNA Computing: New Computing Paradigms. Springer-Verlag, Berlin, 1998.
17. Pǎun, Gh., G. Rozenberg, and A. Salomaa. Membrane computing with external output. TUCS Research Report No. 218, Turku, Finland, 1998.
18. Petre, I. A normal form for P-systems. Bulletin EATCS, 67: 165-172, 1999.