{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:23Z","timestamp":1725567083516},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_91","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"905-914","source":"Crossref","is-referenced-by-count":2,"title":["On Sequential and 1-Deterministic P Systems"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sara","family":"Woodworth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"91_CR1","doi-asserted-by":"crossref","unstructured":"Csuhaj-Varju, E., Ibarra, O., Vaszil, G.: On the computational complexity of P automata. In: Proc. DNA 10 (2004)","DOI":"10.1007\/11493785_7"},{"key":"91_CR2","unstructured":"Dang, Z., Ibarra, O.: On P systems operating in sequential mode. Pre-Proc. DCFS 2004 (2004)"},{"key":"91_CR3","unstructured":"Freund, R.: Sequential P-systems (2000), Available at https:\/\/2.zoppoz.workers.dev:443\/http\/psystems.disco.unimib.it"},{"key":"91_CR4","unstructured":"Freund, R.: Asynchronous P systems. In: Mauri, G., Paun, G., Zandron, C. (eds.) Pre-Proc. Fifth Workshop on Membrane Computing (2004)"},{"key":"91_CR5","unstructured":"Freund, R., Paun, G.: On deterministic P systems (2003), See P Systems Web Page at https:\/\/2.zoppoz.workers.dev:443\/http\/psystems.disco.unimib.it"},{"key":"91_CR6","unstructured":"Frisco, P.: About P systems with symport\/antiport. In: Second Brainstorming Week on Membrane Computing, Sevilla, Spain, pp. 224\u2013236, February 2-7 (2004)"},{"key":"91_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"S. Greibach","year":"1978","unstructured":"Greibach, S.: Remarks on blind and partially blind one-way multicounter machines. Theor. Comput. Sci.\u00a07, 311\u2013324 (1978)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"91_CR8","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. Theor. Comput. Sci.\u00a08(2), 135\u2013159 (1979)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"91_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2004.03.045","volume":"320","author":"O. Ibarra","year":"2004","unstructured":"Ibarra, O.: On the computational complexity of membrane systems. Theor. Comput. Sci.\u00a0320(1), 89\u2013109 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"91_CR10","first-page":"167","volume":"11","author":"O. Ibarra","year":"2004","unstructured":"Ibarra, O., Dang, Z., Egecioglu, O.: Catalytic P systems, semilinear sets, and vector addition systems. Theor. Comput. Sci.\u00a011(1), 167\u2013181 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"91_CR11","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. Ibarra","year":"2004","unstructured":"Ibarra, O., Yen, H., Dang, Z.: On 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)"},{"issue":"2","key":"91_CR12","first-page":"317","volume":"8","author":"C. Martin-Vide","year":"2002","unstructured":"Martin-Vide, C., Paun, A., Paun, G.: On the power of P systems with symport rules. Journal of Universal Computer Science\u00a08(2), 317\u2013331 (2002)","journal-title":"Journal of Universal Computer Science"},{"issue":"3","key":"91_CR13","first-page":"441","volume":"13","author":"E. Mayr","year":"1984","unstructured":"Mayr, E.: An algorithm for the general Petri net reachability problem, SIAM J. Computing\u00a013(3), 441\u2013460 (1984)","journal-title":"Computing"},{"key":"91_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":"91_CR15","doi-asserted-by":"crossref","unstructured":"Mutyam, M., Kriithivasan, K.: P systems with active objects: Universality and efficiency. In: Proc. of the 3rd Int\u2019l Conf. on Machines, Computations, and Universality, May 23-27, 2001, pp. 276\u2013287 (2001)","DOI":"10.1007\/3-540-45132-3_19"},{"issue":"3","key":"91_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF03037362","volume":"20","author":"A. Paun","year":"2002","unstructured":"Paun, A., Paun, G.: The power of communication: P systems with symport\/antiport, New. Generation Computing\u00a020(3), 295\u2013306 (2002)","journal-title":"Generation Computing"},{"issue":"1","key":"91_CR17","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":"91_CR18","doi-asserted-by":"publisher","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":"91_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-36490-0_28","volume-title":"Membrane Computing","author":"P. Sosik","year":"2003","unstructured":"Sosik, P.: P systems versus register machines: Two universality proofs. In: P\u0103un, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol.\u00a02597, pp. 371\u2013382. Springer, Heidelberg (2003)"},{"issue":"8","key":"91_CR20","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s002360050138","volume":"35","author":"H. Yen","year":"1998","unstructured":"Yen, H.: Priority conflict-free Petri nets. Acta Informatica\u00a035(8), 673\u2013688 (1998)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/11533719_91","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:37:54Z","timestamp":1586471874000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/11533719_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":20,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/11533719_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}