Notes on spiking neural P systems and finite automata

Spiking neural P systems (in short, SN P systems) are membrane computing models inspired by the pulse coding of information in biological neurons. SN P systems with standard rules have neurons that emit at most one spike (the pulse) each step, and have either an input or output neuron connected to the environment. A variant known as SN P modules generalize SN P systems by using extended rules (more than one spike can be emitted each step) and a set of input and output neurons. In this work we continue relating SN P modules and finite automata. In particular, we amend and improve previous constructions for the simulatons of deterministic finite automata and state transducers. Our improvements reduce the number of neurons from three down to one, so our results are optimal. We also simulate finite automata with output, and we use these simulations to generate automatic sequences.

[1]  Pan Linqiang,et al.  Spiking neural P systems with neuron division and budding , 2011 .

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

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

[4]  J. Shallit,et al.  Automatic Sequences: Contents , 2003 .

[5]  Daniel Díaz-Pernil,et al.  A parallel algorithm for skeletonizing images by using spiking neural P systems , 2013, Neurocomputing.

[6]  Gheorghe Paun,et al.  Spiking Neural P Systems. Recent Results, Research Topics , 2009, Algorithmic Bioprocesses.

[7]  Andrei Paun,et al.  Small universal spiking neural P systems , 2007, Biosyst..

[8]  Jeffrey Shallit,et al.  Automatic Sequences by Jean-Paul Allouche , 2003 .

[9]  Xiangrong Liu,et al.  Asynchronous spiking neural P systems with rules on synapses , 2015, Neurocomputing.

[10]  Xiangxiang Zeng,et al.  Spiking Neural P Systems with Thresholds , 2014, Neural Computation.

[11]  Giancarlo Mauri,et al.  Solving Numerical NP-Complete Problems with Spiking Neural P Systems , 2007, Workshop on Membrane Computing.

[12]  Turlough Neary.  A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems , 2010, LATA.

[13]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

[14]  Henry N. Adorna,et al.  Spiking neural P systems with structural plasticity , 2015, Neural Computing and Applications.

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

[16]  Linqiang Pan,et al.  Spiking Neural P Systems With Rules on Synapses Working in Maximum Spikes Consumption Strategy , 2015, IEEE Transactions on NanoBioscience.

[17]  Haiming Chen,et al.  Spiking neural P systems with extended rules: universality and languages , 2006, Natural Computing.

[18]  Jean Berstel.  Review of "Automatic sequences: theory, applications, generalizations" by Jean-Paul Allouche and Jeffrey Shallit. Cambridge University Press. , 2004, SIGA.

[19]  Andrei Paun,et al.  On the Universality of Axon P Systems , 2015, IEEE Transactions on Neural Networks and Learning Systems.

[20]  Scott A. Smolka,et al.  Interactive Computation: The New Paradigm , 2006 .

[21]  Oscar H. Ibarra,et al.  On spiking neural P systems , 2006, Natural Computing.

[22]  Gheorghe Paun,et al.  Spiking neural P systems with neuron division and budding , 2011, Science China Information Sciences.

[23]  Xiangxiang Zeng,et al.  Small universal simple spiking neural P systems with weights , 2013, Science China Information Sciences.

[24]  Jeffrey Shallit,et al.  Automatic Sequences: Theory, Applications, Generalizations , 2003 .

[25]  Gheorghe Paun,et al.  Computing Morphisms by Spiking Neural P Systems , 2007, Int. J. Found. Comput. Sci..

[26]  Zhenbing Zeng,et al.  Exact safety verification of hybrid systems using sums-of-squares representation , 2011, Science China Information Sciences.

[27]  Rudolf Freund,et al.  Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems , 2008 .

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