On bounded symport/antiport P systems

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

Volumn 3892 LNCS, Issue , 2006, Pages 129-143

  Ibarra, Oscar H ^a   Woodworth, Sara ^a  

^a University of California   (United States)

Author keywords

Communicating P system; Deterministic; Hierarchy; Multicounter machine; Multihead two way finite automaton; Nondeterministic; Symport antiport system; Turing machine

Indexed keywords

BIOLOGICAL MEMBRANES; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; HIERARCHICAL SYSTEMS; LINEAR CONTROL SYSTEMS; MATHEMATICAL MODELS;

COMMUNICATING P SYSTEM; DETERMINISTIC; HIERARCHY; MULTICOUNTER MACHINE; MULTIHEAD TWO-WAY FINITE AUTOMATON; NONDETERMINISTIC; SYMPORT/ANTIPORT SYSTEM; TURING MACHINE;

NEURAL NETWORKS;

EID: 33745742155     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11753681_10     Document Type: Conference Paper

References (19)

1. C. S. Calude and 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). To be published by Pushchino Publishing House, 2004.
2. E. Csuhaj-Varju, O. H. Ibarra, and G. Vaszil. On the computational complexity of P automata. In Proc. DNA 10 (C. Ferretti, G. Mauri, C. Zandron, eds.), Univ. Milano-Bicocca, 97-106, 2004.
3. Z. Dang, O. H. Ibarra, C. Li, and G. Xie. On model-checking of P systems. Proc. 4th International Conference on Unconventional Computation, to appear, 2005.
4. R. Freund, L. Kari, M. Oswald, and P. Sosik. Computationally universal P systems without priorities: two catalysts are sufficient. Theoretical Computer Science, 330(2): 251-266, 2005.
5. R. Freund and Gh. Paun. On deterministic P systems. See P Systems Web Page at http://psystems.disco.unimib.it, 2003.
6. O. H. Ibarra. The number of membranes matters. In Proc. 4th Workshop on Membrane Computing, Lecture Notes in Computer Science 2933, Springer-Verlag, 218-231, 2004.
7. Journal version to appear in Theoretical Computer Science, 2005.
8. O. H. Ibarra. On determinism versus nondeterminism in P systems. Theoretical Computer Science, to appear, 2005.
9. B. Monien, Two-way multihead automata over a one-letter alphabet, RAIRO Informatique theorique, 14(1):67-82, 1980.
10. A. Paun and Gh. Paun. The power of communication: P systems with symport/antiport. New Generation Computing 20(3): 295-306, 2002.
11. Gh. Paun. Computing with membranes. Turku University Computer Science Research Report No. 208, 1998.
12. Gh. Paun. Computing with membranes. Journal of Computer and System Sciences, 61(1):108-143, 2000.
13. Gh. Paun. Membrane Computing: An Introduction. Springer-Verlag, 2002.
14. Gh. Paun. Further twenty six open problems in membrane computing. See P Systems Web Page at http://psystems.disco.unimib.it, 1-12, January 20, 2005.
15. Gh. Paun, J. Pazos, M. J. Perez-Jimenez, and A. Rodriguez-Paton. Symport/antiport P systems with three objects are universal. Fundamenta Informaticae, 64(1-4): 353-367, 2005.
16. Gh. Paun and G. Rozenberg. A guide to membrane computing. Theoretical Computer Science, 287(1):73-100, 2002.
17. W. Savitch. Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci., 4(2): 177-192, 1970.
18. W. Savitch. A note on multihead automata and context-sensitive languages. Acta Informatica, 2:249-252, 1973.
19. 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.