The power of maximal parallelism in P systems

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

Volumn 3340, Issue , 2004, Pages 212-224

  Ibarra, Oscar H ^a   Yen, Hsu Chun ^b   Dang, Zhe ^c  

^a University of California   (United States)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c Washington State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTING POWER; SET THEORY; VECTORS; SEMANTICS;

COMMUNICATING P SYSTEM; COMPUTING POWER; EVOLUTION RULES; MAXIMALLY PARALLEL; P SYSTEMS; PARALLEL MODE; PARALLEL SYSTEM; POSITIVE INTEGERS; POWER; STANDARD DEFINITIONS; CATALYTIC SYSTEM; CO-OPERATIVE SYSTEMS; SEMI-LINEAR SETS; VECTOR ADDITION SYSTEMS;

SEMANTICS; SET THEORY;

EID: 26844437577     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30550-7_18     Document Type: Article

References (17)

1. H. G. Baker. Rabin's proof of the undecidability of the reachability set inclusion problem for vector addition systems. In C.S.C. Memo 79, Project MAC, MIT, 1973.
2. E. Csuhaj-Varju, J. Dassow, J. Kelemen, and Gh. Paun. Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach Science Publishers, Inc., 1994.
3. Z. Dang and O. H. Ibarra. On P systems operating in sequential and limited parallel modes. In Pre-Proc. 6th Workshop on Descriptional Complexity of Formal Systems, 2004.
4. J. Esparza. Petri nets, commutative context-free grammars, and basic parallel processes. In Proc. Fundamentals of Computer Theory, volume 965 of Lecture Notes in Computer Science, pages 221-232. Springer, 1995.
5. R. Freund. Sequential P-systems. Available at http://psystems.disco. unimib.it, 2000.
6. R. Freund, L. Kari, M. Oswald, and P. Sosik. Computationally universal P systems without priorities: two catalysts are sufficient. Available at http://psystems.disco.unimib.it, 2003.
7. R. Freund and A. Paun. Membrane systems with symport/antiport rules: universality results. In Proc. WMC-CdeA2002, volume 2597 of Lecture Notes in Computer Science, pages 270-287. Springer, 2003.
8. M. H. Hack. The equality problem for vector addition systems is undecidable. In C.S.C. Memo 121, Project MAC, MIT, 1975.
9. J. Hopcroft and J.-J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8(2):135-159, 1979.
10. D.T. Huynh. Commutative grammars: The complexity of uniform word problems. Information and Control, 57:21-39, 1983.
11. O. Ibarra, Z. Dang, and O. Egecioglu. Catalytic P systems, semilinear sets, and vector addition systems. Theoretical Computer Science, 312(2-3): 379-399, 2004.
12. E. Mayr. Persistence of vector replacement systems is decidable. Acta Informat., 15:309-318, 1981.
13. Gh. Paun. Computing with membranes. Journal of Computer and System Sciences, 61(1):108-143, 2000.
14. Gh. Paun. Membrane Computing: An Introduction. Springer-Verlag, 2002.
15. Gh. Paun and G. Rozenberg. A guide to membrane computing. Theoretical Computer Science, 287(1):73-100, 2002.
16. P. Sosik. P systems versus register machines: two universality proofs. In Pre-Proceedings of Workshop on Membrane Computing (WMC-CdeA2002), Curtea de Arges, Romania, pages 371-382, 2002.
17. J. van Leeuwen. A partial solution to the reachability problem for vector addition systems. In Proceedings of STOC'74, pages 303-309.