Computing with Cells: Advances in Membrane Computing

Computing with Cells: Advances in Membrane Computing

Volumn 9780199542864, Issue , 2012, Pages 1-368

  Frisco, Pierluigi ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Cell; Membrane Computing; Membrane Systems; P Systems; Theoretical Computer Science

Indexed keywords

EID: 77955717389     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1093/acprof:oso/9780199542864.001.0001     Document Type: Book

References (255)

1. t/l edition, March 2002.
2. A. Alhazov and M. Cavaliere. Proton pumping P systems. In Martin-Vide et al. [170], pages 70-88.
3. A. Alhazov and R. Freund. P systems with one membrane and symport/ antiport rules of five symbols are computationally complete. In Gutierrez-Naranjo et al. [100], pages 19-28. Available from [238].
4. A. Alhazov, R. Freund, A. Leporati, M. Oswald, and C. Zandron. (Tissue) P systems with unit rules and energy assigned to membranes. Pundamenta Informaticae, 74(4):1-18, 2006.
5. A. Alhazov, R. Freund, and M. Oswald. Symbol/membrane complexity of P systems with symport/antiport. In Freund et al. [67), pages 96-113.
6. A. Alhazov, R. Freund, and M. Oswald. Cell/symbol complexity of tissue P systems with symport/antiport rules. International Journal of Foundations of Computer Science, 17(l):3-25, 2006.
7. A. Alhazov, R. Freund, M. Oswald, and M. Slavkovik. Extended variants of spiking neural P systems generating strings of vectors of non-negative integers. In Hoogeboom et al. [110], pages 123-134.
8. A. Alhazov, R. Freund, and Y. Rogozhin. Computational power of symport/ antiport: history, advances and open problems. In Freund et al. [67], pages 1-30.
9. A. Alhazov, R. Freund, and Y. Rogozhin. Some optimal results on communicative P systems with minimal cooperation. In Gutierrez-Naranjo et al. [99], pages 23-36. Available from [238].
10. A. Alhazov, M. Margenstern, V. Rogozhin, Y. Rogozhin, and S. Verlan. Communicative P systems with minimal cooperation. In Mauri et al. [177], pages 161-177.
11. th Workshop on Membrane Computing. Tarragona. Spain. July 17-22. 2003, 2003. Available from [238].
12. A. Alhazov, L. Pan, and G. Paun. Trading polarizations for labels in P systems with active membranes. Acta Informatica, 41(2-3):111-144, 2004.
13. th International Conference. MCU 2007, Orleans, France, 2007, volume 4664 of Lecture Notes in Computer Science, pages 122-133. Springer-Verlag, Berlin. Heidelberg, New York. 2007.
14. A. Alhazov and Y. Rogozhin. Towards a characterisation of P systems with minimal symport/antiport and two membranes. In Hoogeboom et al. [110], pages 135-153.
15. A. Alhazov and Y. Rogozhin. Skin output in P systems with minimal symport/antiport and two membranes. In Eleftherakis et al. [60], pages 97-112.
16. A. Alhazov, Y. Rogozhin, and S. Verlan. Symport/antiport tissue P systems with minimal cooperation. In Gutierrez-Naranjo et al. [99], pages 37-52. Available from [238].
17. A. Alhazov, Y. Rogozhin, and S. Verlan. Minimal cooperation in symport/ antiport tissue P systems. International Journal of Foundations of Computer Science, 18(1):163-180, 2007.
18. B. Aman and G. Ciobanu. Decidability results for mobile membranes derived from mobile ambients. Pre-proceedings of the Fourth Conference on Computability in Europe, CiE 2008, Athens (Greece).
19. B. Aman and G. Ciobanu. On the reachability problem in P systems with mobile membranes. In Freund et al. [67], pages 113-123.
20. M. Amos. Theoretical and Experimental DNA Computation. Natural computing series. Springer-Verlag, Berlin, Heidelberg, New York, 2005.
21. M. Amos. Genesis Machines: The New Science of Biocornputation. Atlantic Books, 2006.
22. I. Antoniou, C. S. Calude, and M. J. Dinneen, editors. Unconventional Models of Computation, UMC2K, Proceedings on the Second International Conference on Unconventional Models of Computation. Springer-Verlag, Berlin, Heidelberg, New York, 2001.
23. B. S. Baker and R. V. Book. Reversal-bounded multipushdown machines. Journal of Computer and System Science, 8:315-332, 1974.
24. H. G. Baker. Rabin's Proof of the Undecidability of the Reachability Set Inclusion Problem of Vector Addition Systems. Cambridge, Mass.: MIT, Project MAC, Computation Structures Group Memo 79, 1973.
25. Ja. M. Barzin'. On a certain class of Turing machines (Minsky machines). Algebra i Logika, 1(6):42-51, 1962/1963. (in Russian) MR 27 #2415.
26. F. Bernardini and R. Freund. Tissue P systems with communication modes. In Hoogeboom et al. [110], pages 170-182.
27. F. Bernardini and M. Gheorghe. On the power of minimal symport/ antiport. In Martin-Vide et al. [170], pages 72-83.
28. F. Bernardini and M. Gheorghe. Cell communication in tissue P systems and cell division in population P systems. Soft Computing, 9(9):640-649, 2005.
29. F. Bernardini and A. Paun. Universality of minimal symport/antiport: five membranes suffice. In Martin-Vide et al. [170], pages 43-45.
30. D. Besozzi, N. Busi, G. Franco, R. Freund, and G. Paun. Two universality results for (mem)brane systems. In M. A. Gutierrez-Naranjo, G. Paun, A. Riscos-Niinez, and F. R. Romero-Campero, editors, Proceedings of the Fourth Brainstormin Week on Membrane Computing, Seville, Spain. January 30-February 3, 2006, pages 49-62. Fenix Editoria, Sevilla, 2006.
31. A. Binder, R. Freund, M. Oswald, and L. Vock. Extended spiking neural P systems with excitatory and inhibitory astrocytes. In Gutirrez-Naranjo et al. [103], pages 63-72. Available from [238].
32. P. Bonizzoni, C. Ferretti, G. Mauri, and R. Zizza. Separating some splicing models. Information Processing Letters, 79(6):255-259, 2001.
33. R. Borrego-Ropero, D. Diaz-Pernil, and M. J. Perez-Jimenez. Tissue simulator: A graphical tool for tissue P systems. In Pre-proceedings of the International Workshop on Automata for Cellular and Molecular Computing, pages 23-34, 2007. Budapest, Hungary, August 31, 2007.
34. rdedition, 2004.
35. H.-D. Burkhard. Ordered firing in Petri nets. Journal of Information Processing and Cybernetics, 17(2-3):71-86, 1981.
36. N. Busi. On the computational power of the mate/bud/drip brane calculus: interleaving vs. maximal parallelism. In Freund et al. [67], pages 144-158.
37. N. Busi. Towards a causal semantics for brane calculi. In Gutirrez-Naranjo et al. [103], pages 97-112. Available from [238].
38. N. Busi. Using well-structured transition systems to decide divergence for catalytic P systems. Theoretical Computer Science, 372(2-3):125-135, 2007.
39. C. S. Calude, G. Paun, G. Rozenberg, and A. Salomaa, editors. Multiset Processing: Mathematical. Computer Science, and Molecular Computing Points of View {Workshop on Multiset Processing, WMP 2000. Curtea de Arges, Romania. August 21-25, 2000], volume 2235 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2001.
40. L. Cardelli. Brane calculi. In V. Danos and V. Schachter, editors. Computational Methods in Systems Biology, International Conference CMSB 2004. Paris, France, May 26-28, 2004, Revised Selected Papers, volume 3082 of Lecture Notes in Computer Science, pages 257-278. Springer-Verlag, Berlin, Heidelberg, New York, 2004.
41. L. Cardelli and A. D. Gordon. Mobile ambients. In M. Nivat, editor, Foundations of Software Science and Computation Structure, First International Conference, FoSSaCS'98, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28-April 4, 1998, Proceedings, volume 1378 of Lecture Notes in Computer Science, pages 140-155. Springer-Verlag, Berlin, Heidelberg, New York, 1998.
42. L. Cardelli and G. Paun. An universality result for a (mem)brane calculus based on mate/drip operations. International Journal of Foundations of Computer Science, 2005.
43. th. International Conference on String Processing and Information Retrieval, SPIRE 2000, pages 64-74, 2000. La Coruna, Spain.
44. M. Cavaliere, O. Egecioglu, O. H. Ibarra, S. Woodworth, M. lonescu, and G. Paun. Asynchronous spiking neural P systems. Technical Report 9-2007. Microsoft Research-University of Trento, 2007.
45. M. Cavaliere and D. Genova. P systems with symport/antiport of rules. The Journal of Universal Computer Science, 10(5):540-558, 2004.
46. M. Cavaliere, C. Martin-Vide, and G. Paun. Brainstorming week on membrane computing. Technical Report 26/03, Universitat Rovira i Virgili, Tarragona, Spain, 2003.
47. H. Chen, R. Freund, M. lonescu, G. Paun, and M. J. Perez-Jimenez. On string languages generated by spiking neural P systems. Fundamenta Informaticae, 75(1-4):141-162, 2007.
48. H. Chen, M. lonescu, T.-O. Ishdorj, A. Paun, G. Paun, and M. J. Perez- Jimenez. Spiking neural P systems with extended rules: Universality and languages. International Journal on Natural Computing, 7(2): 147-166, 2008.
49. H. Chen, M. lonescu, A. Paun, G. Paun, and B. Popa. On trace languages generated by spiking neural P systems. In Eighth International Workshop on Descriptional Complexity of Formal Systems, (DCFS 2006), pages 94-105, 2006. June 21-23, 2006, Las Cruces, New Mexico, USA.
50. H. Chen, T.-O. Ishdorj, G. Paun, and M. J. Perez-Jimenez. Handling languages with spiking neural p systems with extended rules. Romanian Journal of Information Science and Technology, 9(3):151-162, 2006.
51. G. M. Cooper and R. E. Hausman. The Cell. A Molecular Approach. ASM press, 4t h edition, 2007.
52. D. W. Corne and P. Frisco. Dynamics of HIV infection studied with cellular automata and conformon-P systems. BioSystems, 91(3):531-544, 2008. Special issue: P-systems applications to systems biology.
53. th International Workshop, WMC 2008, Edinburgh, UK, July 2008, 2007. Available at [238].
54. E. Csuhaj-Varju, L. Kari, and G. Paun. Test tube distributed systems based on splicing. Computers and Al, 15(2-3):211-232, 1996.
55. E. Csuhaj-Varju, G. Paun, and G. Vaszil. Tissue-like P systems communicating by request. In K. Kamala and R. Rama, editors, Formal Language Aspects of Natural Computing, volume 3, pages 143-153. Ramanujan Mathematical Society, 2006.
56. E. Csuhaj-Varju and G. Vaszil. P automata or purely communicating accepting P systems. In Paun et al. [221], pages 219-233.
57. D. Diaz-Perin, M. A. Gutierrez-Narajo, M. J. Perez-Jimenez, and A. Riscos- Nunez. A logaritmic bound for solving subset sum with P systems. In Eleftherakis et al. [60], pages 301-315.
58. S. Donatelli and J. Kleijn, editors. Application and Theory of Petri Nets, volume 1639 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 1999.
59. A. Ehrenfeucht, T. Harju, I. Petre, D. M. Prescott, and G. Rozenberg. Computation in Living Cells. Gene Assembly in Ciliates. Springer-Verlag, Berlin, Heidelberg, New York, 2003.
60. th International Workshop, WMC 2007. Thessaloniki, Greece, June 2007, Revised Selected and Invited Papers, volume 4860 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2007.
61. J. Esparza. Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae, 31(1):13-25, 1997.
62. F. Freund. R. Freund, M. Margenstern, M. Oswald, Y. Rogozhin. and S. Verlan. P systems with cutting/recombination rules or splicing rules assigned to membranes. In Martin-Vide et al. [170], pages 191- 202.
63. F. Freund, R. Freund, and M. Oswald. Splicing test tube systems and their relation to splicing membrane systems. In Jonoska et al. [139], pages 139-151.
64. R. Freund. Special variants of P systems inducing an infinite hierarchy with respect to the number of membranes. Bulletin of EATCS, 75:209- 219, 2001.
65. 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.
66. R. Freund, L. Kari, and G. Paun. DNA computation based on splicing: The existence of universal computers. Theory of Computing Systems, 32:69-112, 1999.
67. th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers, volume 3850 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2006.
68. R. Freund, C. Martin-Vide, and G. Paun. From regulated rewriting to computing with membranes: collapsing hierarchies. Theoretical Computer Science, 312:143-188. 2004.
69. R. Freund and M. Oswald. P systems with activated/prohibited membrane channels. In Paun et al. [221], pages 261-269.
70. R. Freund and M. Oswald. A short note on analysing P systems with antiport rules. Bulletin of the European Association for Theoretical Computer Science, 78:231-236, October 2002.
71. R. Freund and M. Oswald. Tissue P systems with symport/antiport rules of one symbols are computationally complete, 2005. Available from [238].
72. R. Freund and M. Oswald. Tissue P systems and (mem)brane systems with mate and drip operations working on strings. Electronic notes in Theoretical Computer Science, 171:105-115, 2007.
73. th International Workshop of Formal Systems, pages 102-113. MTA SZTAKI, Budhapest, 2003. Budapest, Hungary.
74. R. Freund and G. Paun. On deterministic P systems, 2003. Available from [238].
75. R. Freund, G. Paun, and M. J. Perez-Jimenez. Tissue P systems with channels states. Theoretical Computer Science, 330:101-116, 2005.
76. R. Freund and S. Verlan. A formal framework for static (tissue) P systems. In Eleaherakis et al. [60], pages 271-284.
77. P. Frisco. On two variants of splicing super-cell systems. Romanian Journal of Information Science and Technology, 4(l-2):89-100, 2001.
78. P. Frisco. The conformon-P system: A molecular and cell biology-inspired computability model. Theoretical Computer Science, 312(2-3):295-319, 2004.
79. P. Frisco. About P systems with symport/antiport. Soft Computing, 9(9): 664-672. 2005.
80. P. Frisco. Infinite hierarchies of conformon-P systems. In Hoogeboom et al. [110], pages 395-408.
81. P. Frisco. P systems, Petri nets, and Program machines. In Freund et al. [67], pages 209-223.
82. P. Frisco. Conformon-P systems with negative values. In Eleftherakis et al. [60], pages 331-344.
83. P. Frisco. An hierarchy of recognising computational processes. Technical report, Heriot-Watt University, 2007. HW-MACS-TR-0047.
84. P. Frisco. On s-sum vectors. Technical report, Heriot-Watt University, 2008. HW-MACS-TR-0060.
85. P. Frisco and D. W. Corne. Modeling the dynamics of HIV infection with conformon-P systems and cellular automata. In Eleftherakis et al. [60], pages 21-32.
86. th International Symposium on Simbolic and Numeric Algorithms for Scientific Computing, pages 427-430. IEEE Computer Society, 2005. Workshop on Theory and Applications of P Systems, TAPS, Timisoara, Romania, September 26-27, 2005.
87. P. Frisco and H. J. Hoogeboom. Simulating counter automata by P systems with symport/antiport. In Paun et al. [221], pages 288-301.
88. P. Frisco and H. J. Hoogeboom. P systems with symport/antiport simulating counter automata. Acta Informatica, 41(2-3):145-170, 2004.
89. P. Frisco, H. J. Hoogeboom, and P. Sant. A direct construction of a universal P system. Fundamenta Informaticae, 49(1-3):103-122, 2002.
90. P. Frisco and G. Paun. No cycles in compartments. Starting from conformon- P systems. In Gutierrez-Naranjo and Paun [101], pages 157-170. Available from (238].
91. M. R. Garey and D. S. Johnson. Computers and intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco, 1979.
92. th International Meeting on DNA Computing, DNA13, Memphis, TN, USA, Revised Selected Papers.
93. R. Gershoni, E. Keinan, G. Paun, R. Piran, T. Ratner, and S. Shoshani. Research topics arising from the (planned) P systems implementation experiment in Technion. In Gutierrez-Naranjo and Paun [101], pages 183-192. Available from [238].
94. D. E. Green and S. Ji. Molecular Basis of Electron Transport, chapter The electromechanical model of mitochondrial structure and function, pages 1-44. Academic Press, New York. 1972. J. Schultz, B. F. Cameron (eds).
95. S. A. Greibach. Remarks on blind and partially blind one-way multicounter machines. Theoretical Computer Science, 7:311-324. 1978.
96. M. A. Gutierrez-Naranjo, M. J. Perez-Jimenez, and D. Ramirez-Martinez. A software tool for verification of spiking neural P systems. International Journal on Natural Computing, 7(4):485-497, 2008.
97. M. A. Gutierrez-Naranjo. M. J. Perez-Jimenez, A. Riscos-Nuiiez, and F. J. Romero-Campero. On the efficiency of cell-like and tissue-like recognizer membrane systems. Presented at the Workshop on Nature Inspired Cooperative Strategies for Optimization-NICSO 2006, Granada, June 29 30 2006.
98. M. A. Gutierrez-Naranjo, M. J. Perez-Jimenez, and F. J. Romero-Campero. A linear solution for QSAT with membrane creation. In Freund et al. [67], pages 241-252.
99. M. A. Gutierrez-Naranjo, G. Paun, and M. J. Perez-Jimenez, editors. Cellular Computing. Complexity Aspects. Proceedings of the ESF Exploratory Workshop on Cellular Computing (Complexity Aspects). Fenix Editoria, Sevilla, 2005. Available from [238].
100. M. A. Gutierrez-Naranjo, A. Riscos-Nuiiez, F. R. Romero-Campero, and D. Sburlan, editors. Proceedings of the Third Brainstorming week on Membrane Computing. Sevilla, Spain, January 31-February 4, 2005. Fenix Editoria, Sevilla, 2005. Available from [238].
101. M. A. Gutierrez-Naranjo and G. Paun, editors. Proceedings of the Sixth Brainstorming Week on Membrane Computing. Sevilla, February 8, 2008. Fenix Editora, Sevilla, 2008. Available from [238].
102. M. A. Gutirrez-Naranjo, M. J. Perez-Jimenez, A. Riscos-Niinez, and F. J. Romero-Campero. On the power of dissolution in P systems with active membranes. In Freund et al. [67], pages 226-242.
103. M. A. Gutirrez-Naranjo, G. Paun, A. Romero-Jimenez, and A. Riscos- Nuhez, editors. Proceedigns of the Fifth Brainstorming Week on Membrane Computing. Sevilla, Spain, January 29-February 2, 2007. Fenix Editora, Sevilla, 2007. Available from [238].
104. M. Hack. The quality problem for vector addition systems is undecidable. Theoretical Computer Science, 2(l):77-95, 1976.
105. th International Workshop on DNA-Based Computers, DNA8, Sapporo, Japan, June 10- 13, 2002. Revised Papers, volume 2568 of Lecture Notes in Computer Science. Hokkaido University, Springer Verlag, Berlin, Heidelberg, New York, 2002.
106. T. Head. Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bulletin of Mathematical Biology, 49(6):737-759, 1987.
107. T. Head. Splicing schemes and DNA. In G. Rozenberg and A. Salomaa, editors, Lindenmayer Systems: Impact on Theoretical Computer Science and Developmental Biology, pages 371-383. Springer-Verlag, Berlin, Heidelberg, New York, 1992.
108. T. Head. G. Paun. and D. Pixton. Handbook of formal languages, vol. 2: linear modeling: background and application, chapter Language theory and molecular genetics: generative mechanisms suggested by DNA recombination, pages 295-360. Springer-Verlag, Berlin, Heidelberg, New York. 1997.
109. th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers, volume 2450 of Lecture Notes in Computer Science, pages 140-151. Springer-Verlag, Berlin, Heidelberg, New York, 2003.
110. th International Workshop, WMC 2006, Leiden, Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers, volume 4361 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York. 2006.
111. P. W. Hoogersa, H. C. M. Kleijn, and P. S. Thiagarajan. A trace semantics for Petri nets. Information and Computation, 117:98-114, 1995.
112. J. E. Hopcroft and J.-J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8:135-159, 1979.
113. J. E. Hopcroft and D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
114. D. T. Huynh. The complexity of equivalence problems for commutative grammars. Information and Control, 66(1-2):103-121, 1985.
115. O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25:116-133, 1978.
116. O. H. Ibarra. On determinism versus nondeterminism in P systems. Theoretical Computer Science, 344:120-133, 2005.
117. O. H. Ibarra. On membrane hierarchy in P systems. Theoretical Computer Science, 334:115-129, 2005.
118. O. H. Ibarra. Some recent results concerning deterministic P systems. In Gutierrez-Naranjo et al. [99], pages 49-54. Available from [238].
119. O. H. Ibarra, Z. Dang, and O. Egecioglu. Catalytic P systems, semilinear sets, and vector addition systems. Theoretical Computer Science, 312:379- 399, 2004.
120. O. H. Ibarra and G. Paun. Characterizations of context-sensitive languages and other languages classes in terms of symport/antiport P systems. Theoretical Computer Science, 358(1):88-103, 2006.
121. O. H. Ibarra and S. Woodworth. Characterizations of some classes of spiking neural P systems. International Journal on Natural Computing, 7(4):499-517, 2008.
122. th International Workshop on DNA Computing, DNA 11, London, ON, Canada, June 6-9, 2005. Revised Selected Papers, volume 3892 of Lecture Notes in Computer Science, pages 129-143. Springer-Verlag, Berlin, Heidelberg, New York, 2005.
123. O. H. Ibarra and S. Woodworth. Characterizations of some restricted spiking neural P systems. In Hoogeboom et al. [110], pages 424-442.
124. O. H. Ibarra and S. Woodworth. On symport/antiport P systems with small number of objects. International Journal of Computer Mathematics, 83(7):613-629, 2006.
125. O. H. Ibarra, S. Woodworth, H.-C. Yen, and Z. Dang. On symport/antiport P systems and semilimear sets. In Freund et al. [67], pages 253-271.
126. O. H. Ibarra and H.-C. Yen. Deterministic catalytic systems are not universal. Theoretical Computer Science, 363(2): 149-161, 2006.
127. th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings.
128. K. Culik II and T. Harju. Splicing semigroups of dominoes and DNA. Discrete Applied Mathematics, 31:261-277, 1991.
129. Essential Science Indicators: h t t p: / / e s i - t o p i c s . com.
130. M. lonescu, C. Martin-Vide, A. Paun, and G. Paun. Unexpected universality results for three classes of P systems with symport/antiport. In Hagiya and Ohuchi [105], pages 281-290.
131. th International Meeting on DNA Computing, (DNA 12), Revised Selected Papers, volume 4287 of Lecture Notes in Computer Science, pages 1-16. Springer-Verlag, Berlin, Heidelberg, New York, 2007.
132. M. Lonescu. G. Paun, and T. Yokomori. Spiking neural P systems. Fundamenta Informaticae, 71(2-3):279-308, 2006.
133. M. Ito, C. Martin-Vide, and G. Paun. A characterization of Parikh sets of ET0L languages in terms of P systems. In M. Ito. G. Paun, and S. Yu, editors. Words. Semigroups, and Transducers, pages 239-254. World Scientific Publishing Co.. 2001.
134. M. Jantzen. Language theory of Petri nets. In Advances in Petri nets 1986, part I on Petri nets: central models and their properties, pages 397-412. Springer-Verlag, Berlin. Heidelberg, New York. 1987.
135. S. Ji. The Bhopalator: a molecular model of the living cell based on the concepts of conformons and dissipative structures. Journal of Theoretical Biology, 116:395-426, 1985.
136. S. Ji. Free energy and information contents of conformons in proteins and DNA. BioSystems. 54:107-214, 2000.
137. S. Ji. The Bhopalator: an information/energy dual model of the living cell (II). Fundamenta Informaticae, 49(1-3):147-165, 2002.
138. J. P. Jones and Y. V. Matijasevic. Register machine proof of the theorem on exponential Diophantine representation of enumerable sets. The Journal of Symbolic Logic, 49(3):818-829, 1984.
139. th birthday, volume 2950 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2004.
140. th edition, 2000.
141. L. Kari, C. Martin-Vide, and A. Paun. On the universality of P systems with minimal symport/antiport rules. In Jonoska et al. [139], pages 254-265.
142. P. Kefalas, G. Eleftherakis, M. Holcombe, and M. Gheorghe. Simulation and verification of P systems through communicating X-machines. BioSystems, 70(2):135-148, 2003.
143. G. Kemeny and I. M. Goklany. Polarons and conformons. Journal of Theoretical Biology. 40:107-123, 1973.
144. G. Kemeny and I. M. Goklany. Quantum mechanical model for conformons. Journal of Theoretical Biology, 48:23-38, 1974.
145. J. Kleijn and M. Koutny. Processes of membrane systems with promoters and inhibitors. Technical Report CS-TR: 986, School of Computing Science, University of Newcastle (UK), 2006.
146. J. Kleijn, M. Koutny, and G. Rozenberg. Towards a Petri net semantics for membrane systems. In Freund et al. [67], pages 292-309.
147. J. Kleijn, M. Koutny, and G. Rozenberg. Process semantics for membrane systems. Journal of Automata, Languages and Combinatorics, 11:321-340, 2008.
148. S. Krishna. Languages of P systems: computability and complexity. PhD thesis. Indian institute of technology Madras. 2001. India.
149. S. N. Krishna. The power of mobility: four membranes suffice. In S. B. Cooper and L. Torenvliet B. Lowe and, editors, New Computational Paradigms. First Conference on Computability in Europe. CiE 2005. Amsterdam, The Netherlands, June 8-12, Proceedings, volume 3526 of Lecture Notes in Computer Science, pages 242-251. Springer-Verlag, Berlin, Heidelberg, New York, 2005.
150. S. N. Krishna. Upper and lower bounds for the computational power of P systems with mobile membranes. In A. Beckmann, U. Berger, B. Lowe, and J. V. Tucker, editors. Logical Approaches to Computational Barriers. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, volume 3988 of Lecture Notes in Computer Science, pages 526-535. Springer-Verlag, Berlin, Heidelberg, New York, 2006.
151. S. N. Krishna and G. Ciobanu. On the computational power of enhanced mobile membranes. Pre-proceedings of the Fourth Conference on Computability in Europe, CiE 2008, Athens (Greece).
152. S. N. Krishna, K. Lakshmanan, and R. Rama. Tissue P systems with contextual and rewriting rules. In Paun et al. [221], pages 339-351.
153. S. N. Krishna and G. Paun. P systems with mobile membranes. International Journal on Natural Computing, 4(3):255-274, 2005.
154. S. N. Krishna and R. Rama. A variant of P systems with active membranes: solving NP-complete problems. Romanian Journal of Information Science and Technology, 2(4):357-367, 1999.
155. S. N. Krishna and R. Rama. Breaking DES using P systems. Theoretical Computer Science, 299(l-3):495-508, 2003.
156. S. N. Krishna and R. Rama. P systems with replicated rewriting. Journal of Automata, Languages and Combinatorics, 6(3):345-350, 2001.
157. K. Lakshmanan and R. Rama. On the power of tissue P systems with insertion and deletion rules. In Alhazov et al. [11], pages 304 318. Available from [238].
158. J. Van Leeuwen, editor. Handbook of Theoretical Computer Science. Elsevier and MIT Press, 1990.
159. A. Leporati, G. Mauri, C. Zandron, G. Paun, and M. J. Perez-Jimenez. Uniform solutions to SAT and Subset Sum by spiking neural P systems, 2008. submitted.
160. A. Leporati, C. Zandron, C. Ferretti, and G. Mauri. On the computational power of spiking neural P systems, 2007. in press.
161. A. Leporati, C. Zandron, C. Ferretti, and G. Mauri. Solving numerical NPcomplete problems with spiking neural P systems. In Eleftherakis et al. [60], pages 336-352.
162. C. Li, Z. Dang, O. H. Ibarra, and Hsu-Chun Yen. Signaling P systems and verification problems. In L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, editors, ICALP, volume 3580 of Lecture Notes in Computer Science, pages 1462-1473. Springer-Verlag, Berlin, Heidelberg, New York, 2005.
163. th edition, 2007.
164. M. Madhu and K. Krithivasan. P systems with membrane creation: universality and efficiency. In M. Margenstern and Y. Rogozhin, editors, Machines, Computations, and Universality, Third International Conference, MCU 2001, Chisinau, Moldavia, May 23-27, 2001, Proceedings, volume 2055 of Lecture Notes in Computer Science, pages 276-287. Springer-Verlag, Berlin, Heidelberg, New York, 2001.
165. M. Madhu and K. Krithivasan. Improved results about universality of P systems. Bulletin of the European Association for Theoretical Computer Science, 76:162-168, September 2002.
166. V. Manca. A proof of regularity for finite splicing. In Jonoska et al. [139], pages 309-317.
167. M. Margenstern, V. Rogozhin, J. Rogozhin, and S. Verlan. About P systems with minimal symport/antiport rules and four membranes. In Mauri et al. [176], pages 283-294. Available from [238].
168. th International Workshop on DNABased Computers, DNA 2000, Leiden, The Netherlands, June 13-17, 2000, Revised Papers.
169. t/l International Workshop on DNA-Based Computers, DNA 2002, Sapporo, Japan, 10-13 June 2002.
170. C. Martin-Vide, G. Mauri, G. Paun, G. Rozenberg, and A. Salomaa, editors. Membrane Computing. International Workshop, WMC 2003, Tarragona. Spain, July 11-22, 2003, Revised Papers, volume 2933 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2003.
171. C. Martin-Vide, A. Paun, and G. Paun. On the power of P systems with symport rules. The Journal of Universal Computer Science, 8:317-331, 2002.
172. C. Martin-Vide and G. Paun, editors. Fundamenta Informaticae, volume 49(1-3). IOS Press, 2002. Special Issue on Membrane Computing.
173. C. Martin-Vide, G. Paun, and A. Rodriguez Paton. P systems with immediate communication. Romanian Journal of Information Science and Technology, 4(1-2):171-182, 2001.
174. C. Martin-Vide, G. Paun, J. Pazos, and A. Rodriguez-Paton. Tissue P systems. Theoretical Computer Science, 296:295-326, 2003.
175. C. Martin-Vide, G. Paun. and A. Rodriguez-Paton. On P systems with membrane creation. Computer Science Journal of Moldavia, 9(2):134-145. 2001.
176. G. Mauri, G. Paun. M. J. Perez-Jimenez, G. Rozenberg, and A. Salomaa, editors. Pre-proceedings of the Fifth Workshop on Membrane Computing WMC5, held in Milan, Italy, June 14-16, 2004, 2004. Available from [238].
177. th International Workshop, WMC 2004, Milan, Italy, June 14-16. 2004, Revised Selected and Invited Papers, volume 3365 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2005.
178. E. W. Mayr. Persistence of vector replacement systems is decidable. Acta Informatica, 15:309-318, 1981.
179. R. Milner. Communication and Concurrency. Prentice-Hall, Englewood. N.J., 1989.
180. R. Milner. Communicating and Mobile Systems: the n-calculus. Cambridge University press, 1999.
181. M. L. Minsky. Recursive unsolvability of Post's problem of "tag" and other topics in theory of Turing machines. Annals of Mathematics, 74(3):437- 455, 1961.
182. M. L. Minsky. Computation: Finite and Infinite Machmes. Automatic computation. Prentice-Hall. 1967.
183. M. Mutyam. V. J. Prakash, and K. Krithivasan. Rewriting tissue P systems. The Journal of Universal Computer Science, 10(9):1250-1271, 2004.
184. H. Nagda, A. Paun, and A. Rodriguez-Paton. P systems with symport/antiport and time. In Hoogeboom et al. [110], pages 463-476.
185. A. Obtulowicz. Note on some recursive family of P systems with active membranes. Available from [238].
186. A. Obtulowicz. Deterministic P systems for solving SAT problem. Romanian Journal of Information Science and Technology, 4(1-2):195- 202, 2001.
187. A. Obtulowicz. Membrane computing and one-way functions. International Journal of Foundations of Computer Science, 12(4):551-558, 2001.
188. A. Obtulowicz. On P systems with active membranes solving integer factorizing problem in polynomial time. In Calude et al. [39], pages 267-286.
189. L. Pan, A. Alhazov, and T.-O. Ishdorj. Further remarks on P systems with active membranes, separation, merging, and release rules. Soft Computing. 9(9):686-690, 2005.
190. L. Pan and T.-O. Ishdorj. P systems with active membranes and separation rules. The Journal of Universal Computer Science, 10(5):630-649, 2004.
191. C. H. Papadimitriou. Computational Complexity. Addison-Wesley Pub. Co.. 1994.
192. A. Perez-Jimenez, M. J. Perez-Jimenez, and F. Sancho-Caparrini. Computing a partial mapping by P systems: Design and verification. In BWC2003 [46], pages 247-260.
193. A. Perez-Jimenez, M. J. Perez-Jimenez, and Fernando Sancho-Caparrini. Formal verification of a transition P system generating the set 2#2. In BWC2003 [46], pages 261-269.
194. M. J. Perez-Jimenez, A. Romero-Jimenez, and F. Sancho-Caparrini. The P versus NP problem through cellular computing with membranes. In Jonoska et al. [139], pages 338-352.
195. M. J. Perez-Jimenez and A. Riscos-Niinez. A linear-time solution to the Knapsack problem using P systems with active membranes. In Martin-Vide et al. [170], pages 250-268.
196. M. J. Perez-Jimenez and F. J. Romero-Campero. Trading polarizations for bi-stable catalysts in P systems with active membranes. In Mauri et al. [177], pages 373-388.
197. C. A. Petri. Kommunikation mit Automaten. PhD thesis, Rheinisch-Westfalisches Institut fur Instrumentelle Mathematik an der Universitat Bonn, 1962. Germany, Schrift Nr. 2 (in German).
198. D. Pixton. Regularity of splicing languages. Discrete Applied Mathematics, 69(1-2):101-124, August 1996.
199. D. Pixton. Splicing in abstract families of languages. Theoretical Computer Science, 234:135-166, 2000.
200. V. J. Prakash. On the power of tissue P systems working in the maximalone mode. In Alhazov et al. [11], pages 356-364. Available from [238].
201. V. J. Prakash and K. Krithivasan. Simulating boolean circuits with tissue P systems. In Mauri et al. [176], pages 343-359. Available from [238].
202. th International Workshop on DNA-Based Computers, DNA7, Tampa, FL, USA, June 10-13, 2001. Revised Papers, volume 2340, pages 329-339. Springer Verlag, Berlin, Heidelberg, New York, 2001.
203. A. Paun and G. Paun. The power of communication: P systems with symport/ antiport. New Generation Computing, 20(3):295-306, 2002.
204. A. Paun and M. Paun. On the membrane computing based on splicing. In C. Martiin-Vide and V. Mitrana, editors, Where Do Mathematics. Computer Science and Biology Meet, pages 409-422. Kluwer Academic, Dortrecht. 2001.
205. G. Paun. Regular extended H systems are computationally universal. Journal of Automata, Languages, Combinatorics, l(l):27-36, 1996.
206. G. Paun. Structures in Logic and Computer Science. A Selection of Essays in Honor of A. Ehrenfeucht, volume 1261 of Lecture Notes in Computer Science, chapter DNA computing: distributed splicing systems, pages 351- 370. Springer Verlag, Berlin, Heidelberg, New York, 1997. J. Mycielsky, G. Rozenberg and A. Salomaa (eds).
207. G. Paun. Computing with membranes. Journal of Computer and System Science, 1(61):108-143, 2000.
208. G. Paun. On P systems with membrane division. In Antoniou et al. [22], pages 187-201.
209. G. Paun. P systems with active membranes: attacking NP-complete problems. Journal of Automata, Languages and Combinatorics, 6(l):75-90, 2001.
210. G. Paun. Membrane Computing. An Introduction. Springer-Verlag, Berlin, Heidelberg, New York, 2002.
211. G. Paun. Further twentysix open problems in membrane computing. In Gutierrez-Naranjo et al. [100], pages 249-262. Available from [238].
212. G. Paun. Spiking neural P systems with astrocyte-like control. The Journal of Universal Computer Science, 13(11):1707-1721, 2007.
213. G. Paun, J. Pazos, M. J. Perez-Jimenez, and A. Rodriguez-Paton. Symport/ antiport P systems with three objects are universal. Eundamenta Informaticae, 64:1-4, 2005.
214. G. Paun and M. J. Perez-Jimenez. Spiking neural P systems, an overview. In A. B. Porto, A. Pazos, and W. Buno, editors, Advancing Artificial Intelligence through Biological Process Applications. Idea Group Publishing, London, 2008. in press.
215. G. Paun, M. J. Perez-Jimenez, and G. Rozenberg. Infinite spike trains in spiking neural P systems. Submitted, 2005.
216. G. Paun, M. J. Perez-Jimenez, and G. Rozenberg. Spike trains in spiking neural P systems. International Journal of Foundations of Computer Science. 17(4):975-1002, 2006.
217. G. Paun, M. J. Perez-Jimenez, and G. Rozenberg. Computing morphisms by spiking neural P systems. International Journal of Foundations of Computer Science, 18(6):1371-1382, 2007.
218. G. Paun, G. Rozenberg, and A. Salomaa. Computing by splicing. Theoretical Computer Science, 168(2):321-336, 1996.
219. G. Paun, G. Rozenberg, and A. Salomaa. Restricted use of the splicing operation. International Journal of Computer Mathematics, 60:17-32, 1996.
220. G. Paun, G. Rozenberg, and A. Salomaa. DNA Computing: New Computing Paradigms. Springer Verlag, Berlin, Heidelberg, New York, September 1998.
221. G. Paun, G. Rozenberg, A. Salomaa, and C. Zandron, editors. Membrane Computing. International Workshop, WMC-CdeA2002, Curtea de Arges, Romania, August 19-23, 2002, Revised Papers, volume 2597 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2002.
222. G. Paun, Y. Suzuki, H. Tanaka, and T. Yokomori. On the power of membrane division in P systems. Theoretical Computer Science, 324(l):61-85, 2004.
223. G. Paun and T. Yokomori. Membrane computing based on splicing. In E. Winfree and D. K. Gifford, editors, DNA Based Computers V, volume 54 of DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, pages 217-232. American Mathematical Society, 1999.
224. G. Paun and T. Yokomori. Simulating H systems by P systems. Journal of Universal Computer Science, 6(2):178-193, 2000.
225. Gheorghe Paun. Computing with membranes. Technical Report 208, Turku Center for Computer Science-TUCS, 1998.
226. D. Ramirez-Martinez and M. A. Gutierrez-Naranjo. A software tool for dealing with spiking neural P systems. In Gutirrez-Naranjo et al. [103], pages 299-314. Available from [238].
227. W. Reisig. Petri Nets: An Introduction, volume 4 of Monographs in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin, Heidelberg, New York, 1985.
228. W. Reisig and G. Rozenberg, editors. Lectures on Petri Nets I: Basic Models, volume 1491 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 1998.
229. A. Riscos-Ntinez. Cellular programming: efficient resolution of NP-complete numerical problems. PhD thesis, University of Seville, 2004. Spain.
230. Y. Rogozhin and S. Verlan. On the rule complexity of universal tissue P systems. In Freund et al. [67], pages 356-362.
231. G. Rozenberg and J. Engelfriet. Elementary net systems, pages 12-121. Volume 1491 of Reisig and Rozenberg [228], 1998.
232. G. Rozenberg and A. Salomaa. Handbook of Formal Languages. Springer- Verlag, Berlin, Heidelberg, New York, 1996.
233. P. Sosik. P systems versus register machines: two universality proofs. In Pre-Proceedings of the Workshop on Membrane Computing (WMC-CdeA2002), Curtea de Arges, Romania, pages 371-382. MolCoNet (Molecular Computing Network) Publication, 2002.
234. P. Sosik. The computational power of cell division in P systems: Beating down parallel computers? International Journal on Natural Computing, 2(3):287-298, 2003.
235. P. Sosik. The power of catalysts and priorities in membrane systems. Grammars, 6(l):13-24, 2003.
236. P. Sosik and J. Matysek. Membrane computing: when communication is enough. In C. Calude, M. J. Dinneen, and F. Peper, editors, Unconventional Models of Computation. Third International Conference. UMC 2002. Kobe. Japan. October 15-19, 2002, Proceedings, volume 2509 of Lecture Notes in Computer Science, pages 264-275. Springer-Verlag, Berlin, Heidelberg, New York, 2002.
237. About splicing P systems with immediate communication and nonextended splicing P systems. S. verlan. In Martin-Vide et al. [170], pages 369-382.
238. The P Systems Webpage. http://ppage.psystems.eu/.
239. Manca V. Splicing normalization and regularity. In C. Calude and G. Paun. editors. Finite Versus Infinite. Contribution to an Eternal Dilemma, Discrete Mathematics and Theoretical Computer Science, pages 199-215. Springer Verlag, Berlin, Heidelberg, New York, 2000.
240. J. van Leeuwen. A partial solution to the reachability-problem for vectoraddition systems. In STOC '74: Proceedings of the sixth annual ACM symposium on Theory of computing, pages 303-309, New York, NY, USA, 1974. ACM.
241. G. Vaszil. On the size of P systems with minimal symport/antiport. In Mauri et al. [177], pages 404-413.
242. S. Verlan. Head systems and application to bio-informatics. PhD thesis, LITA, Universite' de Metz, 2004. France.
243. th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings, volume 3340 of Lecture Notes in Computer Science, pages 418-429. Springer-Verlag, Berlin, Heidelberg, New York, 2004.
244. S. Verlan. A boundary result on enhanced time-varying distributed H systems with parallel computations. Theoretical Computer Science, 344(2- 3):226-242, 2005.
245. S. Verlan, F. Bernardini, M. Gheorghe, and M. Margenstern. Computational completeness of tissue P systems with conditional uniport. In Hoogeboom et al. [110], pages 521-535.
246. S. Verlan and M. Margenstern. About splicing P systems with one membrane. Fundamenta Informaticae. 65(3):279-290, 2005.
247. S. Verlan and R. Zizza. 1-splicing vs. 2-splicing: separating results. In WORDS 2003, Turku, Finland. 1-14 September 2003, 2003. Pre-proceedings TUCS Report, University of Turku.
248. C. Versari. Encoding catalytic P systems in n. Electron. Notes Theor. Cornput. Sci, 171(2):171-186, 2007.
249. th edition. December 2003.
250. M. V. Volkenstein. The conformon. Journal of Theoretical Biology, 34:193- 195, 1972.
251. Wikipedia. http://www.wikipedia.org, accessed on November 2007.
252. X. Xu. Tissue P systems with parallel rules on channels. In Pre-proceedings of the 1st International Conference on Bio-Inspired Computing-Theory and Applications, pages 168-177, 2006. Wuhan, China.
253. C. Zandron. A Model for Molecular Computing: Membrane Systems. PhD thesis, Universita degli Studi di Milano, Italy, 2002.
254. C. Zandron, C. Ferretti, and G. Mauri. Solving NP-complete problems using P systems with active membranes. In Antoniou et al. [22], pages 289-301.
255. C. Zandron, G. Mauri, and C. Ferretti. Universality and normal forms on membrane systems. In R. Freund and A. Kelemenova, editors, Proceedings of the International Workshop Grammar Systems 2000. Bad Ischl. Austria. July 2000, pages 61-74. Silesian University, Opava, Czech Republic, 2000.