{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:59Z","timestamp":1760202599537},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406716"},{"type":"electronic","value":"9783540451389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_42","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T18:41:48Z","timestamp":1277232108000},"page":"480-489","source":"Crossref","is-referenced-by-count":16,"title":["Characterizations of Catalytic Membrane Computing Systems"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Egecioglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaurav","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","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 (1973)"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/96709.96717","volume-title":"POPL 1990","author":"G. Berry","year":"1990","unstructured":"Berry, G., Boudol, G.: The chemical abstract machine. In: POPL 1990, pp. 81\u201394. ACM Press, New York (1990)"},{"issue":"10","key":"42_CR3","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s00236-002-0090-7","volume":"38","author":"P. Bottoni","year":"2002","unstructured":"Bottoni, P., Martin-Vide, C., Paun, G., Rozenberg, G.: Membrane systems with promoters\/inhibitors. Acta Informatica\u00a038(10), 695\u2013720 (2002)","journal-title":"Acta Informatica"},{"issue":"2","key":"42_CR4","first-page":"33","volume":"5","author":"J. Dassow","year":"1999","unstructured":"Dassow, J., Paun, G.: On the power of membrane computing. Journal of Universal Computer Science\u00a05(2), 33\u201349 (1999)","journal-title":"Journal of Universal Computer Science"},{"key":"42_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":"Fundamentals of Computation Theory","author":"J. Esparza","year":"1995","unstructured":"Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. In: Reichel, H. (ed.) FCT 1995. LNCS, vol.\u00a0965, pp. 221\u2013232. Springer, Heidelberg (1995)"},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-36490-0_17","volume-title":"Membrane Computing","author":"R. Freund","year":"2003","unstructured":"Freund, R., Oswald, M.: P Systems with activated\/prohibited membrane channels. In: P\u0103un, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol.\u00a02597, pp. 261\u2013269. Springer, Heidelberg (2003)"},{"key":"42_CR7","unstructured":"Freund, R., Oswald, M., Sosik, P.: Reducing the number of catalysts needed in computationally universal P systems without priorities. In: the 5th Descriptional Complexity of Formal Systems Workshop (DFCS), July 12-14, Budapest, Hungary (2003)"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-36490-0_19","volume-title":"Membrane Computing","author":"P. Frisco","year":"2003","unstructured":"Frisco, P., Jan Hoogeboom, H.: Simulating counter automata by P Systems with symport\/antiport. In: P\u0103un, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol.\u00a02597, pp. 288\u2013301. Springer, Heidelberg (2003)"},{"key":"42_CR9","unstructured":"Hack, M.H.: The equality problem for vector addition systems is undecidable. In: C.S.C. Memo 121, Project MAC, MIT (1975)"},{"issue":"2","key":"42_CR10","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. TCS\u00a08(2), 135\u2013159 (1979)","journal-title":"TCS"},{"key":"42_CR11","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":"42_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-45132-3_5","volume-title":"Machines, Computations, and Universality","author":"C. Martin-Vide","year":"2001","unstructured":"Martin-Vide, C., Paun, G.: Computing with membranes (P Systems): Universality results. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol.\u00a02055, pp. 82\u2013101. Springer, Heidelberg (2001)"},{"key":"42_CR13","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":"42_CR14","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. Minsky","year":"1961","unstructured":"Minsky, M.: Recursive unsolvability of Post\u2019s problem of Tag and other topics in the theory of Turing machines. Ann. of Math.\u00a074, 437\u2013455 (1961)","journal-title":"Ann. of Math."},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. Journal of the ACM\u00a013, 570\u2013581 (1966)","journal-title":"Journal of the ACM"},{"issue":"1","key":"42_CR16","first-page":"108","volume":"61","author":"G.. Paun","year":"2000","unstructured":"Paun, G.: Computing with membranes. JCSS\u00a061(1), 108\u2013143 (2000)","journal-title":"JCSS"},{"issue":"1","key":"42_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1142\/S0129054100000090","volume":"11","author":"G.. Paun","year":"2000","unstructured":"Paun, G.: Computing with membranes (P Systems): A variant. International Journal of Foundations of Computer Science\u00a011(1), 167\u2013181 (2000)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1","key":"42_CR18","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. TCS\u00a0287(1), 73\u2013100 (2002)","journal-title":"TCS"},{"key":"42_CR19","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., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol.\u00a02597, pp. 400\u2013409. Springer, Heidelberg (2003)"},{"key":"42_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BFb0015232","volume-title":"Analysis of Dynamical and Cognitive Systems","author":"J. Leeuwen van","year":"1995","unstructured":"van Leeuwen, J.: A partial solution to the reachability problem for vector addition systems. In: Andersson, S.I. (ed.) Analysis of Dynamical and Cognitive Systems. LNCS, vol.\u00a0888, pp. 303\u2013309. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T21:44:08Z","timestamp":1552599848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}