Search
Now showing items 1-3 of 3
Article
P automata revisited
(Elsevier, 2012)
We continue here the investigation of P automata, in their non-extended case, a class of devices which characterize non-universal family of languages. First, a recent conjecture is confirmed: any recursively enumerable ...
Article
Spiking Neural P systems with several types of spikes
(Agora University of Oradea, 2011)
With a motivation related to gene expression, where enzymes act in series, somewhat similar to the train spikes traveling along the axons of neurons, we consider an extension of spiking neural P systems, where several ...
Article
Spiking neural P systems with extended rules: universality and languages
(Springer, 2008)
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems and from generating strings; previous ...