Skip to main content
SpringerLink
Log in

Spiking neural P systems with extended rules: universality and languages

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems and from generating strings; previous results from these areas are briefly recalled. Then, the computing power of the obtained systems is investigated, when considering them as number generating and as language generating devices. In the first case, a simpler proof of universality is obtained, while in the latter case we find characterizations of finite and recursively enumerable languages (without using any squeezing mechanism, as it was necessary in the case of standard rules). The relationships with regular languages are also investigated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Chen H, Freund R, Ionescu M, Păun Gh, Pérez-Jiménez MJ (2006) On string languages generated by spiking neural P systems. In Proceedings of the fourth brainstorming week on membrane computing, vol. I, Sevilla, pp 169–193 (available at http://psystems.disco.unimib.it)

  • Ibarra OH, Păun A, Păun Gh, Rodrí guez-Patón A, Sosik P, Woodworth S (2006) Normal forms for spiking neural P systems. In Fourth brainstorming week on membrane computing, Febr. 2006, vol. II, Fenix Editora, Sevilla, pp 105–136

  • Ionescu M, Păun Gh, Yokomori T (2006) Spiking neural P systems. Fundam Informat 71(2–3):279–308

    MATH  Google Scholar 

  • Korec I (1996) Small universal register machines. Theor Comput Sci 168:267–301

    Article  MATH  MathSciNet  Google Scholar 

  • Maass W (2002) Computing with spikes. Special Issue Found Inform Process TELEMATIK 8(1):32–36

    Google Scholar 

  • Maass W, Bishop C (eds) (1999) Pulsed neural networks. MIT Press, Cambridge

    Google Scholar 

  • Minsky M (1967) Computation – finite and infinite machines. Prentice Hall, Englewood Cliffs, NJ

    MATH  Google Scholar 

  • Păun Gh (2002) Membrane computing – an introduction. Springer-Verlag, Berlin

    Google Scholar 

  • Păun A, Păun Gh (to appear) Small universal spiking neural P systems. BioSystems

  • Păun Gh, Pérez-Jiménez MJ, Rozenberg G (2006) Spike trains in spiking neural P systems. Int J Found Computer Sci 17(4):975–1002

    Article  Google Scholar 

  • Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages, 3 volumes. Springer-Verlag, Berlin

    Google Scholar 

  • Salomaa A (1973) Formal languages. Academic Press, New York

    MATH  Google Scholar 

  • The P Systems Web Page: http://psystems.disco.unimib.it

Download references

Acknowledgements

The authors gratefully acknowledge the following (partial) support of their research. H. Chen: Grants numbers 60573013 and 60421001 of the National Natural Science Foundation of China. M. Ionescu: Programa Nacional para la Formación del Profesorado Universitario from the Spanish Ministry of Education. A. Păun: LA BoR RSC grant LEQSF (2004-07)-RD-A-23, and NSF Grants IMR-0414903 and CCF-0523572. Gh. Păun and M.J. Pérez-Jiménez: Project TIN2005-09345-C03-01 of Ministerio de Educación y Ciencia of Spain, cofinanced by FEDER funds, and Project of Excellence TIC 581 of Junta de Andalucia.

Author information

Authors and Affiliations

  1. Computer Science Laboratory, Institute of Software, Chinese Academy of Sciences, 100080, Beijing, China

    Haiming Chen

  2. Universitat Rovira i Virgili, Pl. Imperial Tàrraco 1, 43005, Tarragona, Spain

    Mihai Ionescu

  3. Department of Computer Science and AI, University of Sevilla, Avda Reina Mercedes s/n, 41012, Sevilla, Spain

    Tseren-Onolt Ishdorj, Gheorghe Păun & Mario J. Pérez-Jiménez

  4. Computational Biomodelling Laboratory, TUCS, Abo Akademi University, Turku, 20520, Finland

    Tseren-Onolt Ishdorj

  5. Department of Computer Science, Louisiana Tech University, Ruston, PO Box 10348, LA, 71272, USA

    Andrei Păun

  6. Faculdad de Informatíca, Universidad Politécnica de Madrid – UPM, Campus de Montegancedo s/n, Boadilla del Monte, 28660, Madrid, Spain

    Andrei Păun

  7. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucharest, Romania

    Gheorghe Păun

Authors
  1. Haiming Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mihai Ionescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tseren-Onolt Ishdorj
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andrei Păun
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Gheorghe Păun
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Mario J. Pérez-Jiménez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gheorghe Păun.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, H., Ionescu, M., Ishdorj, TO. et al. Spiking neural P systems with extended rules: universality and languages. Nat Comput 7, 147–166 (2008). https://doi.org/10.1007/s11047-006-9024-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-006-9024-6

Keywords

Search

Navigation