Journal ArticleDOI
On string languages generated by spiking neural p systems with anti-spikes
TLDR
These computing devices allow non-determinism between the rules ac → a and ac → ā, c ϵ ℕ, thus help to generate languages which cannot be generated using simple SN P systems.Abstract:
An Spiking Neural P system with anti-spikes uses two types of objects called spikes and anti-spikes which can encode binary digits in a natural way. The step when system emits a spike or an anti-spike is associated with symbol 1 and 0, respectively. Here we consider these computing devices as language generators. They allow non-determinism between the rules ac → a and ac → ā, c ϵ ℕ, thus help to generate languages which cannot be generated using simple SN P systems.read more
Citations
More filters
Journal ArticleDOI
Design of logic gates using spiking neural P systems with homogeneous neurons and astrocytes-like control
TL;DR: A novel method of constructing logic circuits that work in a neural-like manner is demonstrated, as well as shed some lights on potential directions of designing neural circuits theoretically.
Journal ArticleDOI
Spiking neural P systems with request rules
Tao Song,Linqiang Pan +1 more
TL;DR: It is obtained that SN P systems with request rules are Turing universal, even with a small number of neurons, and with 47 neurons such systems can compute any Turing computable function.
Journal ArticleDOI
On the Universality and Non-Universality of Spiking Neural P Systems With Rules on Synapses
Tao Song,Jinbang Xu,Linqiang Pan +2 more
TL;DR: A Turing universal spiking neural P system with rules on synapses having 6 neurons is constructed, which can generate any set of Turing computable natural numbers.
Journal ArticleDOI
Spiking neural P systems with multiple channels and anti-spikes.
TL;DR: The Turing universality as number generating and accepting devices is proved at first, and then a universal SN P systems with multiple channels and anti-spikes for computing functions is investigated.
Journal ArticleDOI
An improved universal spiking neural P system with generalized use of rules
Yun Jiang,Yansen Su,Fen Luo +2 more
TL;DR: This work investigates the computational completeness of SNGR P systems and makes an improvement regarding to these related parameters, which provides an answer to the open problem mentioned in original work.
References
More filters
Journal Article
On String Languages Generated by Spiking Neural P Systems
TL;DR: In this paper, the authors consider spiking neural P systems as binary string generators, where the set of spike trains of halting computations of a given system constitutes the language generated by that system.
Journal ArticleDOI
Spike trains in spiking neural p systems
TL;DR: A number of ways to assign (code) sets of numbers to (by) spike trains are considered, and it is proved then computational completeness: the computed sets of Numbers are exactly Turing computable sets.
Journal ArticleDOI
Shuffle on trajectories: syntactic constraints
TL;DR: Diverse concepts from the theory of concurrency can be introduced and studied in this framework, providing examples of applications to fairness property and to parallelization of non-context-free languages in terms of context-free and even regular languages.
Spiking Neural dP Systems
TL;DR: This work brings together two topics recently introduced in membrane computing, the much investigated spiking neural P systems and the distributed P systems, and introduces SN dP systems, with the possibility to input, at their request, spikes from the environment.
Journal ArticleDOI
Spiking neural P systems with extended rules: universality and languages
Haiming Chen,Mihai Ionescu,Tseren-Onolt Ishdorj,Andrei Păun,Gheorghe Paun,Mario J. Pérez-Jiménez +5 more
TL;DR: A simpler proof of universality is obtained, while in the latter case characterizations of finite and recursively enumerable languages are found (without using any squeezing mechanism, as it was necessary in the case of standard rules).