{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T17:54:49Z","timestamp":1724176489463},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,2]]},"abstract":"<jats:p> Operations with membranes are essential both in brane calculi and in membrane computing. In this paper we take four basic operations from brane calculi, pino, exo, mate, drip, we express them in terms of the membrane computing formalism, and then we investigate the computing power of the P systems using the mate, drip operations as unique evolution rules. All operations are controlled by \u2013 and make evolve \u2013 multisets of protein-objects embedded in the membranes themselves (not contained in the compartments of the cell, as standard in membrane computing; all compartments delimited by membranes are here empty). Somewhat surprisingly, for systems which use the mate, drip operations we obtain the Turing completeness. The power of P systems based on other operations remains to be investigated. <\/jats:p>","DOI":"10.1142\/s0129054106003693","type":"journal-article","created":{"date-parts":[[2006,2,9]],"date-time":"2006-02-09T10:25:16Z","timestamp":1139480716000},"page":"49-68","source":"Crossref","is-referenced-by-count":29,"title":["AN UNIVERSALITY RESULT FOR A (MEM)BRANE CALCULUS BASED ON MATE\/DRIP OPERATIONS"],"prefix":"10.1142","volume":"17","author":[{"given":"LUCA","family":"CARDELLI","sequence":"first","affiliation":[{"name":"Microsoft Research Cambridge, 7, J.J. Thomson Avenue, Cambridge, CB3 0FB, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GHEORGHE","family":"P\u0102UN","sequence":"additional","affiliation":[{"name":"Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700 Bucure\u015fti, Romania"},{"name":"Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s\/n, 41012 Sevilla, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07675-0_3"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90020-8"},{"key":"rf6","volume-title":"Introduction to Formal Language Theory","author":"Harrison M.","year":"1978"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2"},{"key":"rf9","volume-title":"Formal Languages","author":"Salomaa A.","year":"1973"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106003693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:40:56Z","timestamp":1565138456000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106003693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":6,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,2]]}},"alternative-id":["10.1142\/S0129054106003693"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106003693","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}