Abstract
We investigate finite extended spiking neural P systems as acceptors for infinite sequences of symbols 1 and 0, i.e., of ω-words over {0, 1}. We show that regular ω-languages over {0, 1} can be characterized by deterministic/non-deterministic finite extended spiking neural P systems accepting ω-words in specific modes with respect to the infinite sequence of states the finite extended spiking neural P systems go through during the accepting computations.
Get full access to this article
View all access options for this article.