Author:
Pan Linqiang,Păun Gheorghe
Abstract
Besides usual spikes employed in spiking neural P systems, we consider “anti-spikes", which participate in spiking and forgetting rules, but also annihilate spikes when meeting in the same neuron. This simple extension of spiking neural P systems is shown to considerably simplify the universality proofs in this area: all rules become of the form bc → b′ or bc → lambda , where b,b′ are spikes or anti-spikes. Therefore, the regular expressions which control the spiking are the simplest possi- ble, identifying only a singleton. A possible variation is not to produce anti-spikes in neurons, but to consider some “inhibitory synapses", which transform the spikes which pass along them into anti-spikes. Also in this case, universality is rather easy to obtain, with rules of the above simple forms.
Publisher
Agora University of Oradea
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications
Cited by
184 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献