{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T09:21:51Z","timestamp":1778577711199,"version":"3.51.4"},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2002,12]]},"abstract":"<jats:p> In this paper we consider networks of membranes which compute by communication only, using symport\/antiport rules. Such rules are used both for communication with the environment and for direct communication among membranes. It turns out that, rather surprisingly, networks with a small number of membranes are computationally universal. This is proved both for the case of three membranes where each membrane communicates with each other membrane, and for the case of four membranes consisting of two pairs such that only the membranes within each pair communicate directly. A single pair of communicating membranes can compute the Parikh images of matrix languages. Several open problems are also formulated. <\/jats:p>","DOI":"10.1142\/s012905410200145x","type":"journal-article","created":{"date-parts":[[2002,11,21]],"date-time":"2002-11-21T05:17:37Z","timestamp":1037855857000},"page":"779-798","source":"Crossref","is-referenced-by-count":39,"title":["COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES"],"prefix":"10.1142","volume":"13","author":[{"given":"ANDREI","family":"P\u0102UN","sequence":"first","affiliation":[{"name":"Department of Computer Science,  University of Western Ontario, London, Ontario,  Canada N6A 5B7, Canada"}],"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, 70700 Bucure\u015fti, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GRZEGORZ","family":"ROZENBERG","sequence":"additional","affiliation":[{"name":"Leiden Institute of Advanced Computer Science,  Leiden University, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands"},{"name":"Department of Computer Science,  University of Colorado at Boulder, Boulder, CO 80309, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_2","first-page":"1","volume":"49","author":"Ardelean","year":"2002","journal-title":"Fundamenta Informaticae"},{"key":"p_4","first-page":"2","volume":"8","author":"Martin-Vide A.","year":"2002","journal-title":"J. Univ. Computer ScL"},{"key":"p_5","first-page":"1","volume":"49","author":"Martin-Vide A.","year":"2002","journal-title":"Fundamenta Informaticae"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00117-7"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1684"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905410200145X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:34:01Z","timestamp":1565177641000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905410200145X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":5,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2002,12]]}},"alternative-id":["10.1142\/S012905410200145X"],"URL":"https:\/\/doi.org\/10.1142\/s012905410200145x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}