{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:34:55Z","timestamp":1765233295418},"reference-count":18,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03n04","funder":[{"name":"Artiom Alhazov acknowledges project","award":["20.80009.5007.22"],"award-info":[{"award-number":["20.80009.5007.22"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:p> We consider tissue P systems working on vesicles of multisets with the very simple operations of insertion, deletion, and substitution of single objects. With the whole multiset being enclosed in a vesicle, sending it to a target cell can be indicated in those simple rules working on the multiset. As derivation modes we consider the sequential derivation mode, where, if possible, one rule is applied in a derivation step, and the set maximally parallel derivation mode, where in each derivation step a non-extendable set of rules indicating the same target cell is applied. With the set maximally parallel derivation mode, computational completeness can already be obtained with tissue P systems having a tree structure, whereas tissue P systems even with an arbitrary communication structure are not computationally complete when working in the sequential mode. Adding polarizations \u2014 only the three polarizations [Formula: see text], [Formula: see text], [Formula: see text] are sufficient \u2014 allows for obtaining computational completeness even for tissue P systems working in the sequential mode. <\/jats:p>","DOI":"10.1142\/s0129054122410015","type":"journal-article","created":{"date-parts":[[2022,4,30]],"date-time":"2022-04-30T08:50:47Z","timestamp":1651308647000},"page":"179-202","source":"Crossref","is-referenced-by-count":3,"title":["Tissue P Systems with Vesicles of Multisets"],"prefix":"10.1142","volume":"33","author":[{"given":"Artiom","family":"Alhazov","sequence":"first","affiliation":[{"name":"Vladimir Andrunachievici Institute of Mathematics and Computer Science, Academiei 5 Chi\u015fin\u0103u, MD-2028, Moldova"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rudolf","family":"Freund","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, TU Wien, Favoritenstra\u00dfe 9\u201311, 1040 Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergiu","family":"Ivanov","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, Universit\u00e9 \u00c9vry, IBISC, 91020, \u00c9vry-Courcouronnes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Verlan","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Est Creteil, LACL, 94010, Creteil, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2022,4,30]]},"reference":[{"key":"S0129054122410015BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-015-9534-1"},{"key":"S0129054122410015BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.06.004"},{"key":"S0129054122410015BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04921-2_8"},{"key":"S0129054122410015BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-003-0114-y"},{"key":"S0129054122410015BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2"},{"issue":"2","key":"S0129054122410015BIB007","first-page":"33","volume":"5","author":"Dassow J.","year":"1999","journal-title":"J. UCS"},{"key":"S0129054122410015BIB008","first-page":"155","volume-title":"Third Brainstorming Week on Membrane Computing","author":"Freund R.","year":"2005"},{"key":"S0129054122410015BIB009","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.31.11"},{"key":"S0129054122410015BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.05.011"},{"key":"S0129054122410015BIB011","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.128.13"},{"key":"S0129054122410015BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-60252-3_11"},{"key":"S0129054122410015BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-013-9396-3"},{"key":"S0129054122410015BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45655-4_32"},{"key":"S0129054122410015BIB015","volume-title":"Computation. Finite and Infinite Machines","author":"Minsky M. L.","year":"1967"},{"key":"S0129054122410015BIB016","first-page":"275","volume-title":"Proceedings NCMA 2016","author":"Popescu \u015e.","year":"2016"},{"key":"S0129054122410015BIB017","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1693"},{"key":"S0129054122410015BIB018","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11467-0"},{"key":"S0129054122410015BIB019","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054122410015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T02:57:06Z","timestamp":1652929026000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054122410015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":18,"journal-issue":{"issue":"03n04","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["10.1142\/S0129054122410015"],"URL":"https:\/\/doi.org\/10.1142\/s0129054122410015","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]}}}