<?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%">Haiming Chen</style></author><author><style face="normal" font="default" size="100%">Mihai Ionescu</style></author><author><style face="normal" font="default" size="100%">Tseren-Onolt Ishdorj</style></author><author><style face="normal" font="default" size="100%">Andrei Paun</style></author><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></authors></contributors><titles><title><style face="normal" font="default" size="100%">Spiking Neural P systems with extended rules: universality and languages</style></title><secondary-title><style face="normal" font="default" size="100%">Natural Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">chomsky hierarchy</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">spiking neural P systems</style></keyword><keyword><style  face="normal" font="default" size="100%">Turing computability</style></keyword><keyword><style  face="normal" font="default" size="100%">Universality</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">06/2008</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s11047-006-9024-6</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Netherlands</style></publisher><volume><style face="normal" font="default" size="100%">7</style></volume><pages><style face="normal" font="default" size="100%">147-166</style></pages><abstract><style face="normal" font="default" size="100%">We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems and from generating strings; previous results from these areas are briefly recalled. Then, the computing power of the obtained systems is investigated, when considering them as number generating and as language generating devices. In the first case, a simpler proof of universality is obtained, while in the latter case we find characterizations of finite and recursively enumerable languages (without using any squeezing mechanism, as it was necessary in the case of standard rules). The relationships with regular languages are also investigated.</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue></record></records></xml>