Deterministic catalytic systems are not universal

Theoretical Computer Science

Volumn 363, Issue 2, 2006, Pages 149-161

  Ibarra, Oscar H ^a   Yen, Hsu Chun ^b  

^a University of California   (United States)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Counter machine; Deterministic catalytic system; Deterministic versus nondeterministic; Membrane computing; Priority; Semilinear set; Symport antiport system

Indexed keywords

AUTOMATA THEORY; CODES (SYMBOLS); COMPUTER SCIENCE; INTEGER PROGRAMMING; SET THEORY;

COUNTER MACHINES; DETERMINISTIC CATALYTIC SYSTEMS; DETERMINISTIC VERSUS NONDETERMINISTIC; MEMBRANE COMPUTING; SEMILINEAR SETS; SYMPORT/ANTIPORT SYSTEMS;

CATALYSTS;

EID: 33749371006     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.07.029     Document Type: Article

References (15)

1. A. Alhazov, On the power of deterministic EC P systems, Second Brainstorming Week on Membrane Computing 2004, Sevilla, Spain, February 2-7, 2004.
2. Bause F. On the analysis of Petri nets with static priorities. Acta Inform. 33 7 (1996) 669-685
3. C. Calude, G. Pǎun, Computing with Cells and Atoms: After Five Years (new text added to Russian edition of the book with the same title first published by Taylor and Francis Publishers, London, 2001), Pushchino Publishing House, submitted for publication.
4. Dickson L. Finiteness of the odd perfect and primitive abundant numbers with distinct factors. Amer. J. Math. 35 4 (1913) 413-422
5. Freund R., Kari L., Oswald M., and Sosik P. Computationally universal P systems without priorities: two catalysts are sufficient. Theoret. Comput. Sci. 330 2 (2005) 251-266
6. R. Freund, G. Pǎun, On deterministic P systems. See P systems web page at: 〈http://psystems.disco.unimib.it〉.
7. Ginsburg S. The Mathematical Theory of Context-Free Languages (1966), McGraw-Hill, New York
8. O. Ibarra, H. Yen, Z. Dang, The power of maximal parallelism in P systems, in: Proc. Eighth Internat. Conf. on Developments in Language Theory (DLT'04), Lecture Notes in Computer Science, Vol. 3340, Springer, Berlin, 2004, pp. 212-224.
9. Pǎun A., and Pǎun G. The power of communication: P systems with symport/antiport. New Generation Comput. 20 3 (2002) 295-306
10. G. Pǎun, Computing with membranes, Research Report No. 208, Turku University of Computer Science, 1998.
11. Pǎun G. Computing with membranes. J. Comput. System Sci. 61 1 (2000) 108-143
12. Pǎun G. Membrane Computing: an Introduction (2002), Springer, Berlin
13. G. Pǎun, Further twenty six open problems in membrane computing, Written for the Third Brainstorming Week on Membrane Computing, Sevilla, Spain. See P systems web page at: 〈http://psystems.disco.unimib.it〉, 2005.
14. Pǎun G., and Rozenberg G. A guide to membrane computing. Theoret. Comput. Sci. 287 1 (2002) 73-100
15. P. Sosik, P systems versus register machines: two universality proofs, in: Pre-Proc. of Workshop on Membrane Computing (WMC-CdeA2002), Curtea de Argeş, Romania, 2002, pp. 371-382.