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 ArticleDOI
Thin and slender languages
Gheorghe Paun,Arto Salomaa +1 more
TL;DR: In this paper, the authors studied regular and context-free languages with at most one word of every length, or a number of words bounded by a constant independent of the length.
Journal ArticleDOI
On language equations with invertible operations
TL;DR: The paper studies language equations of the type X ?
Proceedings ArticleDOI
On the decomposition of finite languages
Arto Salomaa,Sheng Yu +1 more
TL;DR: In this paper, the authors investigated the uniqueness of prime decompositions, as well as the commuting of the factors, and showed that the notion of a decomposition set turns out to be a powerful tool.
Journal ArticleDOI
Decidability of trajectory-based equations
Michael Domaratzki,Kai Salomaa +1 more
TL;DR: In this paper, the decidability of existence of solutions to language equations involving the operations of shuffle and deletion along trajectories is investigated, and both positive and negative results are shown.
Trajectory-based operations
Kai Salomaa,Michael Domaratzki +1 more
TL;DR: This thesis examines the state complexity of the shuffle on trajectories and introduces the operation of deletion along trajectories, which serves as an inverse to shuffle on trajectoryories, and investigates classes of languages, decidability questions, and related binary relations.