On membrane hierarchy in P systems

Theoretical Computer Science

Volumn 334, Issue 1-3, 2005, Pages 115-129

  Ibarra, Oscar H ^a  

^a University of California   (United States)

Author keywords

Communicating P system; Counter machine; Hierarchy; Membrane computing; Semilinear set; System with tentacles; Two way multihead finite automaton

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DNA; FINITE AUTOMATA; FORMAL LANGUAGES; MATHEMATICAL MODELS; POLYNOMIALS;

COMMUNICATING P SYSTEMS; COUNTER MACHINES; HIERARCHY; MEMBRANE COMPUTING; SEMILINEAR SETS; SYSTEM WITH TENTACLES; TWO-WAY MULTIHEAD FINITE AUTOMATON;

BIOTECHNOLOGY;

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

References (19)

1. G. Berry, G. Boudol, The chemical abstract machine, Proc. 17th Symp. on Principles of Programming Languages (POPL 1990), ACM Press, New York, 1990, pp. 81-94.
2. E. Csuhaj-Varju, G. Vaszil, P automata, Pre-Proc. 2nd Workshop on Membrane Computing (WMC-CdeA2002), Curtea de Arges, Romania, 2002, pp. 177-192.
3. R. Freund Special variants of P systems inducing an infinite hierarchy with respect to the number of membranes Bull. EATCS 75 2001 209 219
4. R. Freund, and M. Oswald A short note on analyzing P systems with antiport rules Bull. EATCS 78 2002 231 236
5. T. Harju, O. Ibarra, J. Karhumaki, and A. Salomaa Some decision problems concerning semilinearity and commutation J. Comput. System Sci. 65 2002 278 294
6. J. Hopcroft, R. Motwani, J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 2000.
7. O.H. Ibarra, On the computational complexity of membrane systems, Theoret. Comput. Sci. C, to appear.
8. O.H. Ibarra, Z. Dang, and O. Egecioglu Catalytic P systems Semilinear sets, and vector addition systems, Theoret. Comput. Sci. 312 2004 379 399
9. S. Krishna, Infinite hierarchies on some variants of P systems, submitted, 2002. See also Languages of P systems: computability and complexity, Ph.D. Thesis, Indian Institute of Technology Madras, India, 2001.
10. S. Krishna, Infinite hierarchies on some variants of P systems, submitted, 2002. See also Languages of P systems: computability and complexity, Ph.D. Thesis, Indian Institute of Technology Madras, India, 2001.
11. B. Monien Two-way multihead automata over a one-letter alphabet RAIRO Inform. Theor. 14 1 1980 67 82
12. Gh. Paun Computing with membranes J. Comput. System Sci. 61 1 2000 108 143
13. Gh. Paun, Membrane Computing: An Introduction, Springer, Berlin, 2002.
14. Gh. Paun, List of problems circulated before the Brainstorming Week in Membrane Computing held in Tarragona, Spain, February 5-11, 2003.
15. A. Paun, and Gh. Paun The power of communication: P systems with symport/antiport New Generation Comput. 20 3 2002 295 306
16. Gh. Paun, M. Perez-Jimenez, F. Sancho-Caparrini, On the reachability problem for P systems with symport/antiport, Proc. 10th Internat. Conf. on Automata and Formal Languages, Debrecen, Hungary, 2002.
17. Gh. Paun, and G. Rozenberg A guide to membrane computing Theoret. Comput. Sci. 287 1 2002 73 100
18. P. Sosik, P systems versus register machines: two universality proofs, Pre-Proc. 2nd Workshop on Membrane Computing (WMC-CdeA2002), Curtea de Arges, Romania, 2002, pp. 371-382.
19. P. Sosik, J. Matysek, Membrane computing: when communication is enough, in: C.S. Calude, et al., (Eds.), Unconventional Models of Computation, 3rd Internat. Conf., Lecture Notes in Computer Science, Vol. 2509, Springer, Berlin, 2002, pp. 264-275.