<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gheorghe Paun</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Grzegorz Rozenberg</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Computing morphisms by spiking neural P systems</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Foundations of Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">68Q10 (AMSC)</style></keyword><keyword><style  face="normal" font="default" size="100%">68Q42 (AMSC)</style></keyword><keyword><style  face="normal" font="default" size="100%">68Q45 (AMSC)</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Morphism</style></keyword><keyword><style  face="normal" font="default" size="100%">Spiking neural P system</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">12/2007</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1142/S0129054107005418</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">18</style></volume><pages><style face="normal" font="default" size="100%">1371-1382</style></pages><abstract><style face="normal" font="default" size="100%">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.</style></abstract><issue><style face="normal" font="default" size="100%">6</style></issue></record></records></xml>