{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T19:32:11Z","timestamp":1766086331020},"reference-count":8,"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> In this paper we introduce and study Mealy multiset automata, presenting some useful properties of multisets and comparing various approaches. We present the notions of bisimulation, observability, and behavior for Mealy multiset automata. We give a characterization of the bisimulation relation between two Mealy multiset automata, and a result relating their general behavior and sequential behavior. We define cascade and direct product of Mealy multiset automata. Then we introduce Mealy membrane automata corresponding to elementary P systems. <\/jats:p>","DOI":"10.1142\/s0129054106003723","type":"journal-article","created":{"date-parts":[[2006,2,9]],"date-time":"2006-02-09T10:25:16Z","timestamp":1139480716000},"page":"111-126","source":"Crossref","is-referenced-by-count":23,"title":["MEALY MULTISET AUTOMATA"],"prefix":"10.1142","volume":"17","author":[{"given":"GABRIEL","family":"CIOBANU","sequence":"first","affiliation":[{"name":"Romanian Academy, Institute of Computer Science, Bd. Carol I, nr.8, RO-700505 Ia\u015fi, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MIHAI","family":"GONTINEAC","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics, \"A.I. Cuza\" University, Bd. Carol I, nr. 11, RO-700506 la\u015fi, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0303-2647(03)00032-7"},{"key":"rf3","volume-title":"Unconventional Programming Paradigms","author":"Cardelli L.","year":"2004"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.03.036"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0303-2647(03)00035-2"},{"key":"rf9","volume-title":"Automata. Languages and Machines","author":"Eilenberg S.","year":"1976"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525889"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69959-7"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106003723","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:41:00Z","timestamp":1565138460000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106003723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":8,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,2]]}},"alternative-id":["10.1142\/S0129054106003723"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106003723","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}