On String Languages Generated by Spiking Neural P Systems

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.

[1]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[2]  A Salomaa,et al.  Bidirectional sticker systems. , 1998, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[3]  Wolfgang Maass,et al.  Paradigms for Computing with Spiking Neurons , 2002 .

[4]  Hendrik Jan Hoogeboom,et al.  Simulating Counter Automata by P Systems with Symport/Antiport , 2002, WMC-CdeA.

[5]  Christopher J. Bishop,et al.  Pulsed Neural Networks , 1998 .

[6]  Grzegorz Rozenberg,et al.  Handbook of formal languages, vol. 1: word, language, grammar , 1997 .

[7]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[8]  Mohamed A. M. S Taha,et al.  Regulated Rewriting in Formal Language Theory , 2008 .

[9]  Zdzislaw Pawlak,et al.  A Treatise on Rough Sets , 2005, Trans. Rough Sets.

[10]  Wulfram Gerstner,et al.  Spiking Neuron Models , 2002 .

[11]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[12]  Wulfram Gerstner,et al.  SPIKING NEURON MODELS Single Neurons , Populations , Plasticity , 2002 .

[13]  Gheorghe Paun,et al.  Spike Trains in Spiking Neural P Systems , 2006, Int. J. Found. Comput. Sci..

[14]  Matthias Jantzen,et al.  Petri net algorithms in the theory of matrix grammars , 2005, Acta Informatica.

[15]  Máté Lengyel,et al.  Computing with spikes , 2006 .

[16]  Grzegorz Rozenberg,et al.  Handbook of formal languages, vol. 3: beyond words , 1997 .

[17]  Oscar H. Ibarra,et al.  Normal forms for spiking neural P systems , 2007, Theor. Comput. Sci..

[18]  Joost Engelfriet,et al.  Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages , 1980, JACM.

[19]  Gheorghe Paun.  Spiking Neural P Systems: A Tutorial , 2007, Bull. EATCS.

[20]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[21]  Wulfram Gerstner,et al.  Spiking Neuron Models: An Introduction , 2002 .

[22]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .