乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:38:46Z","timestamp":1740181126841,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T00:00:00Z","timestamp":1627948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T00:00:00Z","timestamp":1627948800000},"content-version":"vor","delay-in-days":0,"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,9]]},"abstract":"Abstract<\/jats:title>Catalytic P systems are among the first variants of membrane systems ever considered in this area. This variant of systems also features some prominent computational complexity questions, and in particular the problem of using only one catalyst in the whole system: is one catalyst enough to allow for generating all recursively enumerable sets of multisets? Several additional ingredients have been shown to be sufficient for obtaining computational completeness even with only one catalyst. In this paper, we show that one catalyst is sufficient for obtaining computational completeness if either catalytic rules have weak priority over non-catalytic rules or else instead of the standard maximally parallel derivation mode, we use the derivation mode maxobjects<\/jats:italic>, i.e., we only take those multisets of rules which affect the maximal number of objects in the underlying configuration.<\/jats:p>","DOI":"10.1007\/s41965-021-00079-x","type":"journal-article","created":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T14:02:49Z","timestamp":1627999369000},"page":"170-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["When catalytic P systems with one catalyst can be computationally complete"],"prefix":"10.1007","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6184-3971","authenticated-orcid":false,"given":"Artiom","family":"Alhazov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1255-1953","authenticated-orcid":false,"given":"Rudolf","family":"Freund","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6286-0917","authenticated-orcid":false,"given":"Sergiu","family":"Ivanov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,3]]},"reference":[{"key":"79_CR1","doi-asserted-by":"publisher","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\u201415th International Conference, CMC 2014, Prague, Czech Republic, August 20\u201322, 2014, Revised Selected Papers, Lecture Notes in Computer Science, vol. 8961, pp. 99\u2013125. Springer. https:\/\/doi.org\/10.1007\/978-3-319-14370-5_7.","DOI":"10.1007\/978-3-319-14370-5_7"},{"key":"79_CR2","unstructured":"Alhazov, A., Freund, R., & Ivanov, S. (2020). Catalytic P systems with weak priority of catalytic rules. In: Freund, R. (Ed.) Proceedings ICMC 2020, September 14\u201318, 2020, TU Wien, pp. 67\u201382."},{"key":"79_CR3","unstructured":"Alhazov, A., Freund, R., & Ivanov, S. (2020). Computational completeness of catalytic P systems with weak priority of catalytic rules over non-cooperative rules. In: Orellana-Mart\u00edn, D., P\u0103un, Gh., Riscos-N\u00fa\u00f1ez, A., P\u00e9rez-Hurtado, I. (Eds.) Proceedings 18th Brainstorming Week on Membrane Computing, Sevilla, February 4\u20137, 2020. RGNC REPORT 1\/2020, Research Group on Natural Computing, Universidad de Sevilla, pp. 21\u201332."},{"key":"79_CR4","doi-asserted-by":"crossref","unstructured":"Dassow, J., & P\u0103un, Gh. (1989). Regulated Rewriting in Formal Language Theory. Springer. https:\/\/www.springer.com\/de\/book\/9783642749346.","DOI":"10.1007\/978-3-642-74932-2"},{"issue":"2","key":"79_CR5","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. https:\/\/doi.org\/10.1016\/j.tcs.2004.06.029.","journal-title":"Theoretical Computer Science"},{"key":"79_CR6","doi-asserted-by":"publisher","unstructured":"Freund, R., Leporati, A., Mauri, G., Porreca, A. E., Verlan, S., & Zandron, C. (2014). Flattening in (tissue) P systems. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Yu., Rozenberg, G., Salomaa, A. (eds.) Membrane Computing, Lecture Notes in Computer Science, vol. 8340, pp. 173\u2013188. Springer. https:\/\/doi.org\/10.1007\/978-3-642-54239-8_13.","DOI":"10.1007\/978-3-642-54239-8_13"},{"issue":"1\u20132","key":"79_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3233\/FI-2015-1144","volume":"136","author":"R Freund","year":"2015","unstructured":"Freund, R., Oswald, M., & P\u0103un, Gh. (2015). Catalytic and purely catalytic P systems and P automata: Control mechanisms for obtaining computational completeness. Fundamenta Informaticae, 136(1\u20132), 59\u201384. https:\/\/doi.org\/10.3233\/FI-2015-1144.","journal-title":"Fundamenta Informaticae"},{"key":"79_CR8","doi-asserted-by":"publisher","unstructured":"Freund, R., & Sos\u00edk, P. (2015). On the power of catalytic P systems with one catalyst. In: Rozenberg, G., Salomaa, A., Sempere, J. M., Zandron, C. (eds.) Membrane Computing\u201416th International Conference, CMC 2015, Valencia, Spain, August 17\u201321, 2015, Revised Selected Papers, Lecture Notes in Computer Science, vol. 9504, pp. 137\u2013152. Springer. https:\/\/doi.org\/10.1007\/978-3-319-28475-0_10.","DOI":"10.1007\/978-3-319-28475-0_10"},{"key":"79_CR9","volume-title":"Computation: Finite and infinite machines","author":"ML Minsky","year":"1967","unstructured":"Minsky, M. L. (1967). Computation: Finite and infinite machines. Englewood Cliffs, NJ: Prentice Hall."},{"issue":"1","key":"79_CR10","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"Gh P\u0103un","year":"2000","unstructured":"P\u0103un, Gh. (2000). Computing with membranes. Journal of Computer and System Sciences, 61(1), 108\u2013143. https:\/\/doi.org\/10.1006\/jcss.1999.1693.","journal-title":"Journal of Computer and System Sciences"},{"key":"79_CR11","doi-asserted-by":"publisher","unstructured":"P\u0103un, Gh. (2002). Membrane Computing: An introduction. Springer. https:\/\/doi.org\/10.1007\/978-3-642-56196-2.","DOI":"10.1007\/978-3-642-56196-2"},{"key":"79_CR12","doi-asserted-by":"crossref","unstructured":"P\u0103un, Gh., Rozenberg, G., & Salomaa, A. (Eds.). (2010). The Oxford Handbook of Membrane Computing. Oxford University Press.","DOI":"10.1007\/978-3-642-11467-0"},{"key":"79_CR13","doi-asserted-by":"publisher","unstructured":"Rozenberg, G., & Salomaa, A. (Eds.) (1997). Handbook of Formal Languages. Springer. https:\/\/doi.org\/10.1007\/978-3-642-59136-5.","DOI":"10.1007\/978-3-642-59136-5"},{"key":"79_CR14","unstructured":"The P Systems Website. http:\/\/ppage.psystems.eu\/."}],"container-title":["Journal of Membrane Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-021-00079-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41965-021-00079-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-021-00079-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T08:28:45Z","timestamp":1631262525000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41965-021-00079-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["79"],"URL":"https:\/\/doi.org\/10.1007\/s41965-021-00079-x","relation":{},"ISSN":["2523-8906","2523-8914"],"issn-type":[{"type":"print","value":"2523-8906"},{"type":"electronic","value":"2523-8914"}],"subject":[],"published":{"date-parts":[[2021,8,3]]},"assertion":[{"value":"7 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"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"}}]}}