{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:27:45Z","timestamp":1725575265305},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540278849"},{"type":"electronic","value":"9783540314820"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11527800_18","type":"book-chapter","created":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T09:20:04Z","timestamp":1294824004000},"page":"225-237","source":"Crossref","is-referenced-by-count":0,"title":["P Systems: Some Recent Results and Research Problems"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"C.S.C. Memo 79, Project MAC","author":"H.G. Baker","year":"1973","unstructured":"Baker, H.G.: Rabin\u2019s proof of the undecidability of the reachability set inclusion problem for vector addition systems. In: C.S.C. Memo 79, Project MAC. MIT, Cambridge (1973)"},{"key":"18_CR2","unstructured":"Calude, C.S., Paun, G.: 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)"},{"key":"18_CR3","unstructured":"Csuhaj-Varju, E., Ibarra, O.H., Vaszil, G.: On the computational complexity of P automata. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) Proc. DNA 10, Univ. Milano-Bicocca, pp. 97\u2013106 (2004)"},{"key":"18_CR4","unstructured":"Dang, Z., Ibarra, O.H.: On P systems operating in sequential mode. In: Pre-Proc. 6th Workshop on Descriptional Complexity of Formal Systems (2004)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-60249-6_54","volume-title":"Proc. Fundamentals of Computer Theory","author":"J. Esparza","year":"1995","unstructured":"Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. In: Proc. Fundamentals of Computer Theory. LNCS, vol.\u00a0965, pp. 221\u2013232. Springer, Heidelberg (1995)"},{"key":"18_CR6","unstructured":"Freund, R.: Sequential P-systems (2000), Available at \n                    \n                      http:\/\/psystems.disco.unimib.it"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.tcs.2004.06.029","volume":"330","author":"R. Freund","year":"2005","unstructured":"Freund, R., Kari, L., Oswald, M., Sosik, P.: Computationally universal P systems without priorities: two catalysts are sufficient. Theoretical Computer Science\u00a0330(2), 251\u2013266 (2005)","journal-title":"Theoretical Computer Science"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-36490-0_18","volume-title":"Membrane Computing","author":"R. Freund","year":"2003","unstructured":"Freund, R., Paun, A.: Membrane systems with symport\/Antiport rules: Universality results. In: P\u0103un, G., et al. (eds.) WMC 2002. LNCS, vol.\u00a02597, pp. 270\u2013287. Springer, Heidelberg (2003)"},{"key":"18_CR9","unstructured":"Freund, R., Paun, G.: On deterministic P systems (2003), See \n                    \n                      http:\/\/psystems.disco.unimib.it"},{"key":"18_CR10","volume-title":"C.S.C. Memo 121, Project MAC","author":"M.H. Hack","year":"1975","unstructured":"Hack, M.H.: The equality problem for vector addition systems is undecidable. In: C.S.C. Memo 121, Project MAC. MIT, Cambridge (1975)"},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science\u00a08(2), 135\u2013159 (1979)","journal-title":"Theoretical Computer Science"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0019-9958(83)80022-9","volume":"57","author":"D.T. Huynh","year":"1983","unstructured":"Huynh, D.T.: Commutative grammars: The complexity of uniform word problems. Information and Control\u00a057, 21\u201339 (1983)","journal-title":"Information and Control"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-24619-0_16","volume-title":"Membrane Computing","author":"O.H. Ibarra","year":"2004","unstructured":"Ibarra, O.H.: The number of membranes matters. In: Mart\u00edn-Vide, C., et al. (eds.) WMC 2003. LNCS, vol.\u00a02933, pp. 218\u2013231. Springer, Heidelberg (2004)"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Ibarra, O.H.: On the computational complexity of membrane systems. Theoretical Computer Science, 89\u2013109 (2004)","DOI":"10.1016\/j.tcs.2004.03.045"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Ibarra, O.H.: On determinism versus nondeterminism in P systems. Theoretical Computer Science (2005) (to appear)","DOI":"10.1016\/j.tcs.2005.03.052"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-30550-7_18","volume-title":"Developments in Language Theory","author":"O.H. Ibarra","year":"2004","unstructured":"Ibarra, O.H., Yen, H., Dang, Z.: The power of maximal parallelism in P systems. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 212\u2013224. Springer, Heidelberg (2004)"},{"key":"18_CR17","unstructured":"Martin-Vide, C., Paun, A., Paun, G.: On the power of P systems with symport rules. Journal of Universal Computer Science, 317\u2013331 (2002)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF00289268","volume":"15","author":"E. Mayr","year":"1981","unstructured":"Mayr, E.: Persistence of vector replacement systems is decidable. Acta Informatica\u00a015, 309\u2013318 (1981)","journal-title":"Acta Informatica"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Paun, A., Paun, G.: The power of communication: P systems with symport\/antiport. New Generation Computing, 295\u2013306 (2002)","DOI":"10.1007\/BF03037362"},{"issue":"1","key":"18_CR20","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G.. Paun","year":"2000","unstructured":"Paun, G.: Computing with membranes. Journal of Computer and System Sciences\u00a061(1), 108\u2013143 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane Computing: An Introduction","author":"G. Paun","year":"2002","unstructured":"Paun, G.: Membrane Computing: An Introduction. Springer, Heidelberg (2002)"},{"key":"18_CR22","unstructured":"Paun, G., Perez-Jimenez, M., Sancho-Caparrini, F.: On the reachability problem for P systems with symport\/antiport (2002) (submitted)"},{"issue":"1","key":"18_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(02)00136-6","volume":"287","author":"G. Paun","year":"2002","unstructured":"Paun, G., Rozenberg, G.: A guide to membrane computing. Theoretical Computer Science\u00a0287(1), 73\u2013100 (2002)","journal-title":"Theoretical Computer Science"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Savitch, W.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci., 177\u2013192 (1970)","DOI":"10.1016\/S0022-0000(70)80006-X"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Savitch, W.: A note on multihead automata and context-sensitive languages. Acta Informatica, 249\u2013252 (1973)","DOI":"10.1007\/BF00289080"},{"key":"18_CR26","unstructured":"Sosik, P.: P systems versus register machines: two universality proofs. In: Pre-Proceedings of Workshop on Membrane Computing (WMC-CdeA 2002), Curtea de Arges, Romania, pp. 371\u2013382 (2002)"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/3-540-36490-0_28","volume-title":"Membrane Computing","author":"P. Sosik","year":"2003","unstructured":"Sosik, P., Freund, R.: P systems without priorities are computationally universal. In: P\u0103un, G., et al. (eds.) WMC 2002. LNCS, vol.\u00a02597, pp. 400\u2013409. Springer, Heidelberg (2003)"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/3-540-45833-6_22","volume-title":"Unconventional Models of Computation","author":"P. Sos\u00edk","year":"2002","unstructured":"Sos\u00edk, P., Mat\u00fdsek, J.: Membrane computing: when communication is enough. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol.\u00a02509, pp. 264\u2013275. Springer, Heidelberg (2002)"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"van Leeuwen, J.: A partial solution to the reachability problem for vector addition systems. In: Proceedings of STOC 1974, pp. 303\u2013309 (1974)","DOI":"10.1145\/800119.803908"}],"container-title":["Lecture Notes in Computer Science","Unconventional Programming Paradigms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11527800_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:30:08Z","timestamp":1558294208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11527800_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540278849","9783540314820"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11527800_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}