On determinism versus nondeterminism in P systems

Theoretical Computer Science

Volumn 344, Issue 2-3, 2005, Pages 120-133

  Ibarra, Oscar H ^a  

^a University of California   (United States)

Author keywords

Communicating P system; Counter machine; Determinism versus nondeterminism; Molecular computing; P system; Two way multihead finite automaton

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; LARGE SCALE SYSTEMS; PROBLEM SOLVING;

COMMUNICATING P SYSTEM; COUNTER MACHINE; DETERMINISM VERSUS NONDETERMINISM; MOLECULAR COMPUTING; P SYSTEM; TWO-WAY MULTIHEAD FINITE AUTOMATON;

COMPUTER SCIENCE;

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

References (13)

1. C.S. Calude, Gh. Paun, 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, 2004, to be published.
2. E. Csuhaj-Varju, O.H. Ibarra, and G. Vaszil On the computational complexity of P automata C. Ferretti G. Mauri C. Zandron Proc. of the DNA 10 2004 University of Milano-Bicocca 97 106
3. R. Freund, L. Kari, M. Oswald, and P. Sosik Computationally universal P systems without priorities: two catalysts are sufficient Theoret. Comput. Sci. 330 2 2005 251 266
4. R. Freund, Gh. Paun, On deterministic P systems, See P Systems Web Page at http://psystems.disco.unimib.it, 2003.
5. O.H. Ibarra, The number of membranes matters, in: Proc. of the Fourth Workshop on Membrane Computing, Lecture Notes in Computer Science, vol. 2933, Springer, Berlin, 2004, pp. 218-231.
6. Gh. Paun, Computing with membranes, Turku University Computer Science Research Report No. 208, 1998.
7. Gh. Paun Computing with membranes J. Comput. System Sci. 61 1 2000 108 143
8. Gh. Paun Membrane Computing: An Introduction 2002 Springer Berlin
9. A. Paun, and Gh. Paun The power of communication: P systems with symport/antiport New Generation Comput. 20 3 2002 295 306
10. Gh. Paun, and G. Rozenberg A guide to membrane computing Theoret. Comput. Sci. 287 1 2002 73 100
11. W. Savitch Relationships between nondeterministic and deterministic tape complexities J. Comput. System Sci. 4 2 1970 177 192
12. W. Savitch A note on multihead automata and context-sensitive languages Acta Inform. 2 1973 249 252
13. P. Sosik, P systems versus register machines: two universality proofs, in: Pre-Proc. of Workshop on Membrane Computing (WMC-CdeA2002), Curtea de Arges, Romania, 2002, pp. 371-382.