Generalized p-systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1684, Issue , 1999, Pages 281-292

  Freund, Rudolf ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES;

ARRAY GRAMMAR; CONTEXT-FREE; GRAPH GRAMMAR; P SYSTEMS; SINGLE OBJECT;

COMPUTATION THEORY;

EID: 84956866529     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48321-7_23     Document Type: Conference Paper

References (10)

1. G. Berry and G. Boudol, The chemical abstract machine, Theoretical Computer Science 96 (1992), pp. 217-248.
2. J. Dassow and Gh. Păun, Regulated Rewritinrg in Formal Language Theory (Springer, Berlin, 1989).
3. J. Dassow and Gh. Păun, On the power of membrane computing, TUCS Research Report No. 217 (Dec. 1998).
4. R. Freund and B. Haberstroh, Attributed elementary programmed graph grammars, Proceedings 17th International Workshop on Graph-Theoretic Concepts in Computer Science (LNCS 570, Springer-Verlag, 1991), pp. 75-84.
5. R. Freund, Control mechanisms on #-context-free array grammars, Mathematical Aspects of Natural and Formal Languages (Gh. Paun, ed.), World Scientific, Singapore (1994), pp. 97-137.
6. Gh. Păun, Computing with membranes, TUCS Research Report No. 208 (Nov. 1998).
7. Gh. Păun, Computing with membranes: an introduction, Bulletin EATCS 67 (Febr.1999), pp. 139-152.
8. Gh. Păun, G. Rozenberg, and A. Salomaa, DNA Computing: New Computing Paradigms (Springer-Verlag, Berlin, 1998).
9. Gh. Păun, G. Rozenberg, and A. Salomaa, Membrane computing with external output, TUCS Research Report No. 218 (Dec. 1998).
10. I. Petre, A normal form for P-systems, Bulletin EATCS 67 (Febr. 1999), pp. 165-172.