Formal languages
Petri net algorithms in the theory of matrix grammars
Acta Informatica
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Pulsed neural networks
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
Journal of the ACM (JACM)
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Spiking Neuron Models: An Introduction
Spiking Neuron Models: An Introduction
Computation: finite and infinite machines
Computation: finite and infinite machines
Fundamenta Informaticae
Normal forms for spiking neural P systems
Theoretical Computer Science
Transactions on Rough Sets IV
Bibliography of spiking neural P systems
Natural Computing: an international journal
On string languages generated by spiking neural P systems with exhaustive use of rules
Natural Computing: an international journal
Characterizations of some classes of spiking neural P systems
Natural Computing: an international journal
Asynchronous spiking neural P systems
Theoretical Computer Science
On languages generated by asynchronous spiking neural P systems
Theoretical Computer Science
Homogeneous Spiking Neural P Systems
Fundamenta Informaticae
Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
Theoretical Computer Science
Solving NP-Complete problems by spiking neural p systems with budding rules
WMC'09 Proceedings of the 10th international conference on Membrane Computing
A p---lingua based simulator for spiking neural p systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Fundamenta Informaticae
Computing k-block Morphisms by Spiking Neural P Systems
Fundamenta Informaticae
Hi-index | 0.00 |
We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated by that system. Although the "direct" generative capacity of spiking neural P systems is rather restricted (some very simple languages cannot be generated in this framework), regular languages are inverse-morphic images of languages of finite spiking neural P systems, and recursively enumerable languages are projections of inverse-morphic images of languages generated by spiking neural P systems.