Journal ArticleDOI
On string languages generated by spiking neural p systems with anti-spikes
Reads0
Chats0
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 ArticleDOI
Characterizations of some classes of spiking neural P systems
Oscar H. Ibarra,Sara Woodworth +1 more
TL;DR: This work analyzes asynchronous and sequential neural-like SN P systems and presents some conditions under which they become (non-)universal.
Journal ArticleDOI
On languages factorizing the free monoid
Marcella Anselmo,Antonio Restivo +1 more
TL;DR: It is proved that it is decidable whether a regular language X is factorizing and the product is unambiguous and an automaton recognizing the corresponding language Y is constructed.
Proceedings ArticleDOI
Prime decompositions of regular prefix codes
TL;DR: In this article, a linear time algorithm is designed which finds the prime decomposition F1F2... Fk of a regular prefix code F given by its minimal deterministic automaton.
Journal ArticleDOI
Restricted sets of trajectories and decidability of shuffle decompositions
Michael Domaratzki,Kai Salomaa +1 more
TL;DR: This work considers decompositions of regular languages with respect to shuffle along a regular set of trajectories and obtains positive decidability results for restricted classes of trajectory and establishes in the spirit of the Dassow-Hinz undecidability result an undecideability result for regular languages shuffled along a fixed linear context-free set of trajectoryories.