Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems

Article type: Research Article

Authors: Freund, Rudolf | Oswald, Marion

Affiliations: Faculty of Informatics, Institute of Computer Languages Vienna University of Technology Favoritenstraße 9, A-1040 Wien, Austria. E-mails: [email protected]; [email protected]

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.

Journal: Fundamenta Informaticae, vol. 83, no. 1-2, pp. 65-73, 2008