{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:16Z","timestamp":1759638256991,"version":"3.33.0"},"reference-count":5,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2007,12]]},"abstract":"<jats:p>We continue the study of the spiking neural P systems considered as transducers of binary strings or binary infinite sequences, and we investigate their ability to compute morphisms. The class of computed morphisms is rather restricted: length preserving or erasing, and the so-called 2-block morphisms can be computed; however, non-erasing non-length-preserving morphisms cannot be computed.<\/jats:p>","DOI":"10.1142\/s0129054107005418","type":"journal-article","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T07:37:41Z","timestamp":1193643461000},"page":"1371-1382","source":"Crossref","is-referenced-by-count":5,"title":["COMPUTING MORPHISMS BY SPIKING NEURAL<font>P<\/font>SYSTEMS"],"prefix":"10.1142","volume":"18","author":[{"given":"GHEORGHE","family":"P\u0102UN","sequence":"first","affiliation":[{"name":"Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700 Bucure\u015fti, Romania"},{"name":"Department of Computer Science and AI, University of Sevilla, Avda. Reina Mercedes s\/n, 41012 Sevilla, Spain"}]},{"given":"MARIO J.","family":"P\u00c9REZ-JIM\u00c9NEZ","sequence":"additional","affiliation":[{"name":"Department of Computer Science and AI, University of Sevilla, Avda. Reina Mercedes s\/n, 41012 Sevilla, Spain"}]},{"given":"GRZEGORZ","family":"ROZENBERG","sequence":"additional","affiliation":[{"name":"Leiden Institute of Advanced Computer Science, LIACS, University of Leiden, Niels Bohr Weg 1, 2333 CA Leiden, The Netherlands"},{"name":"Department of Computer Science, University of Colorado at Boulder, Boulder, CO 80309-0430, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.3233\/FUN-2006-712-308","volume":"71","author":"Ionescu M.","journal-title":"Fundamenta Informaticae"},{"volume-title":"Combinatorics on Words","year":"1983","author":"Lothaire M.","key":"rf2"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054106004212"},{"key":"rf6","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\/S0129054107005418","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:12:01Z","timestamp":1737504721000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054107005418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":5,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1142\/S0129054107005418"],"URL":"https:\/\/doi.org\/10.1142\/s0129054107005418","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}