Advertisement

Spiking Neural P Systems with Cooperating Rules

  • Venkata Padmavati MettaEmail author
  • Srinivasan Raghuraman
  • Kamala Krithivasan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8961)

Abstract

The concept of cooperation and distribution as known from grammar systems is introduced to spiking neural P systems (in short, SN P systems) in which each neuron has a finite number of sets (called components) of rules. During computations, at each step only one of the components can be active for the whole system and one of the enabled rules from this active component of each neuron fires. The switching between the components occurs under different cooperation strategies. This paper considers the terminating mode, in which the switching occurs when no rule is enabled in the active component of any neuron in the system. By introducing this new mechanism, the computational power of asynchronous and sequential SN P systems with standard rules is investigated. The results are that asynchronous standard SN P systems with two components and strongly sequential unbounded SN P systems with two components are Turing complete.

Keywords

Spike Train Turing Machine Output Neuron Standard Rule Single Spike 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cavaliere, M., Ibarra, O.H., Păun, Gh., Egecioglu, Ö., Ionescu, M., Woodworth, S.: Asynchronous spiking neural P systems. Theoretical Computer Science 410(24–25), 2352–2364 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Csuhaj-Varjú, E., Dassow, J.: On cooperating/distributed grammar systems. Journal of Information Processing and Cybernetics (EIK) 26, 49–63 (1990)zbMATHGoogle Scholar
  3. 3.
    Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, Gh.: Grammar Systems. A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, London (1994)Google Scholar
  4. 4.
    Ibarra, O.H., Woodworth, S., Yu, F., Păun, A.: On spiking neural P systems and partially blind counter machines. Natural Computing 7(1), 3–19 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Ionescu, M., Păun, Gh., Yokomori, T.: Spiking neural P systems. Fundamenta Informaticae 71, 279–308 (2006)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Meersman, R., Rozenberg, G.: Cooperating grammar systems. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, pp. 364–374. Springer, Heidelberg (1978)CrossRefGoogle Scholar
  7. 7.
    Minsky, M.: Computation - Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)zbMATHGoogle Scholar
  8. 8.
    Pan, L., Păun, Gh.: Spiking neural P systems: An improved normal form. Theoretical Computer Science 411, 906–918 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Păun, Gh., Rozenberg, G., Salomaa, A. (eds.): Handbook of Membrane Computing. Oxford University Press, Oxford (2010)zbMATHGoogle Scholar
  10. 10.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 3. Springer, Berlin (1997)zbMATHGoogle Scholar
  11. 11.
    Zeng, X., Zhang, X., Pan, L.: Homogeneous spiking neural P systems. Fundamenta Informaticae 97, 1–20 (2009)MathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Venkata Padmavati Metta
    • 1
    Email author
  • Srinivasan Raghuraman
    • 2
  • Kamala Krithivasan
    • 2
  1. 1.Institute of Computer Science and Research Institute of the IT4Innovations Centre of ExcellenceSilesian University in OpavaOpavaCzech Republic
  2. 2.Indian Institute of TechnologyChennaiIndia

Personalised recommendations