Formal languages
Communication complexity and parallel computing
Communication complexity and parallel computing
Handbook of Formal Languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Computation: finite and infinite machines
Computation: finite and infinite machines
Fundamenta Informaticae
On String Languages Generated by Spiking Neural P Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Asynchronous spiking neural P systems
Theoretical Computer Science
The Oxford Handbook of Membrane Computing
The Oxford Handbook of Membrane Computing
An infinite hierarchy of languages defined by dP systems
Theoretical Computer Science
Theoretical Computer Science
| Hi-index | 0.00 |
We bring together two topics recently introduced in membrane computing, the much investigated spiking neural P systems (in short, SN P systems), inspired from the way the neurons communicate through spikes, and the dP systems (distributed P systems, with components which “read” strings from the environment and then cooperate in accepting their concatenation). The goal is to introduce SN dP systems, and to this aim we first introduce SN P systems with the possibility to input, at their request, spikes from the environment; this is done by so-called request rules. A preliminary investigation of the obtained SN dP systems (they can also be called automata) is carried out. As expected, request rules are useful, while the distribution in terms of dP systems can handle languages which cannot be generated by usual SN P systems. We always work with extended SN P systems; the non-extended case, as well as several other natural questions remain open.