{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T08:56:06Z","timestamp":1783414566988,"version":"3.54.6"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T00:00:00Z","timestamp":1614816000000},"content-version":"vor","delay-in-days":3,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"TU Wien"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Membr Comput"],"published-print":{"date-parts":[[2021,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>P systems are a model of compartmentalized multiset rewriting inspired by the structure of living cells and the way they function. In this paper, we focus of a variant in P systems in which membranes have limited capacity, i.e., the number of objects they may hold is limited by a fixed bound. This feature corresponds to an important physical property of cellular compartments. We propose several possible semantics of limited capacity and show that one of them allows real-time simulations of partially blind register machines, while the other one allows for obtaining computational completeness.<\/jats:p>","DOI":"10.1007\/s41965-020-00068-6","type":"journal-article","created":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T09:03:42Z","timestamp":1614848622000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["P systems with limited number of objects"],"prefix":"10.1007","volume":"3","author":[{"given":"Artiom","family":"Alhazov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1255-1953","authenticated-orcid":false,"given":"Rudolf","family":"Freund","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergiu","family":"Ivanov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,4]]},"reference":[{"issue":"3","key":"68_CR1","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.ipl.2005.01.017","volume":"100","author":"A Alhazov","year":"2006","unstructured":"Alhazov, A. (2006). P systems without multiplicities of symbol-objects. Information Processing Letters, 100(3), 124\u2013129.","journal-title":"Information Processing Letters"},{"key":"68_CR2","doi-asserted-by":"crossref","unstructured":"Alhazov, A., & Freund, R. (2014). P systems with toxic objects. In Gheorghe, M., Rozenberg, G., Salomaa, A., Sos\u00edk, P., & Zandron C. (Eds.), Membrane Computing \u2013 15th International Conference, CMC 2014, Prague, Czech Republic, August 20\u201322, 2014, Revised Selected Papers, volume 8961 of Lecture Notes in Computer Science, pages 99\u2013125. Springer.","DOI":"10.1007\/978-3-319-14370-5_7"},{"issue":"1\u20132","key":"68_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.3233\/FI-2014-1088","volume":"134","author":"A Alhazov","year":"2014","unstructured":"Alhazov, A., & Freund, R. (2014). Length P systems. Fundamenta Informaticae, 134(1\u20132), 17\u201337.","journal-title":"Fundamenta Informaticae"},{"key":"68_CR4","unstructured":"Alhazov, A., Freund, R., & Ivanov, S. (2020). P systems with limited capacity. In David Orellana-Mart\u00edn, Gheorghe P\u0103un, Agust\u00edn Riscos-N\u00fa\u00f1ez, and Ignacio P\u00e9rez-Hurtado, editors, Proceedings 18th Brainstorming Week on Membrane Computing, Sevilla, February 4\u20137, 2020, pages 33\u201347. RGNC REPORT 1\/2020, Research Group on Natural Computing, Universidad de Sevilla."},{"key":"68_CR5","unstructured":"Alhazov, A., Freund, R., & Ivanov, S. (2020). P systems with limiting the number of objects in membranes. In Rudolf Freund and Tseren-Onolt Ishdorj, editors, Electronic Proceedings of the International Conference on Membrane Computing 2020 (ICMC 2020), Wien, September 14\u201317, 2020, pp. 83\u201398. TU Wien."},{"issue":"7","key":"68_CR6","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1080\/00207160601065314","volume":"83","author":"A Alhazov","year":"2006","unstructured":"Alhazov, A., Freund, R., & Riscos-N\u00fa\u00f1ez, A. (2006). Membrane division, restricted membrane creation and object complexity in P systems. International Journal of Computer Mathematics, 83(7), 529\u2013547.","journal-title":"International Journal of Computer Mathematics"},{"key":"68_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J Dassow","year":"1989","unstructured":"Dassow, J., & P\u0103un, Gh. (1989). Regulated Rewriting in Formal Language Theory. Berlin: Springer."},{"issue":"2","key":"68_CR8","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., & Sos\u00edk, P. (2005). Computationally universal P systems without priorities: two catalysts are sufficient. Theoretical Computer Science, 330(2), 251\u2013266.","journal-title":"Theoretical Computer Science"},{"key":"68_CR9","doi-asserted-by":"crossref","unstructured":"Freund, R., & Sos\u00edk, P. (2015). On the power of catalytic P systems with one catalyst. In Grzegorz Rozenberg, Arto Salomaa, Jos\u00e9\u00a0M. Sempere, and Claudio Zandron, editors, Membrane Computing \u2013 16th International Conference, CMC 2015, Valencia, Spain, August 17\u201321, 2015, Revised Selected Papers, volume 9504 of Lecture Notes in Computer Science, pages 137\u2013152. Springer.","DOI":"10.1007\/978-3-319-28475-0_10"},{"key":"68_CR10","volume-title":"Computation. Finite and Infinite Machines","author":"L Marvin","year":"1967","unstructured":"Marvin, L. (1967). Computation. Finite and Infinite Machines. Englewood Cliffs: Prentice Hall."},{"issue":"1","key":"68_CR11","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G P\u0103un","year":"2000","unstructured":"P\u0103un, Gh. (2000). Computing with membranes. Journal of Computer and System Sciences, 61(1), 108\u2013143.","journal-title":"Journal of Computer and System Sciences"},{"key":"68_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane Computing: An Introduction","author":"G P\u0103un","year":"2002","unstructured":"P\u0103un, Gh. (2002). Membrane Computing: An Introduction. Berlin: Springer."},{"key":"68_CR13","doi-asserted-by":"crossref","unstructured":"P\u0103un, Gh., Rozenberg, G., & Salomaa, A. (Eds.). (2010). The Oxford Handbook of Membrane Computing. Oxford: Oxford University Press.","DOI":"10.1007\/978-3-642-11467-0"},{"key":"68_CR14","unstructured":"Rozenberg, G., & Salomaa, A. (Eds.). (1997). Handbook of Formal Languages. Berlin: Springer."},{"key":"68_CR15","unstructured":"The P Systems Website. (2019). http:\/\/ppage.psystems.eu\/."}],"container-title":["Journal of Membrane Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-020-00068-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41965-020-00068-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-020-00068-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T17:00:22Z","timestamp":1616605222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41965-020-00068-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["68"],"URL":"https:\/\/doi.org\/10.1007\/s41965-020-00068-6","relation":{},"ISSN":["2523-8906","2523-8914"],"issn-type":[{"value":"2523-8906","type":"print"},{"value":"2523-8914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3]]},"assertion":[{"value":"24 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}