SpringerLink
Log in

Eilenberg P Systems

  • Conference paper
  • First Online:
Membrane Computing (WMC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2597))

Included in the following conference series:

Abstract

A class of P systems, called EP systems, with string objects processed by evolution rules distributed alongside the transitions of an Eilenberg machine, is introduced. A parallel variant of EP systems, called EPP systems, is also defined and the power of both EP and EPP systems is investigated in relationshipwith three parameters: number of membranes, states and set of distributed rules. It is shown that EPP systems represent a promising framework for solving NP-complete problems. In particular linear time solutions are provided for the SAT problem.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 42.79
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 53.49
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. T. Bălănescu, T. Cowling, H. Georgescu, M. Gheorghe, M. Holcombe, C. Vertan, Communicating stream X-machines systems are no more than X-machines, J. Universal Comp. Sci., 5, 9 (1999), 494–507.

    MATH  Google Scholar 

  2. C. Calude, Gh. Păun, Computing with Cells and Atoms, Taylor and Francis, London, 2000.

    Google Scholar 

  3. E. Csuhaj-Varju, J. Dassow, J. Kelemen, Gh. Păun, Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon & Breach, London, 1994.

    MATH  Google Scholar 

  4. J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer Verlag, Berlin, 1989.

    Google Scholar 

  5. S. Eilenberg, Automata, Languages and Machines, Academic Press, 1974.

    Google Scholar 

  6. C. Ferretti, G. Mauri, Gh. Păun, C. Zandron, On Three Variants of Rewriting P Systems, Pre-proceedings of Workshop on Membrane Computing (WMCCdeA2001), (C. Martin-Vide, Gh. Păun, eds), Curtea de Argeş, Romania, August 2001, 63–76, and Theor. Comp. Sci., to appear.

    Google Scholar 

  7. R. Freund, Gh. Păun, On the number of non-terminals in graph-controlled, programmed, and matrix grammars, Proc. Conf. Universal Machines and Computations, Chisinau, 2001 (M. Margenstern and Y. Rogozhin, eds.), Springer-Verlag, Berlin, 2001.

    Google Scholar 

  8. M. Gheorghe, Generalised stream X-machines and cooperating grammar systems, Formal Aspects of Computing, 12 (2000), 459–472.

    Article  MATH  Google Scholar 

  9. M. Gheorghe, M. Holcombe, P. Kefalas, Computational models of collective foraging, BioSystems, 61 (2001), 133–141.

    Article  Google Scholar 

  10. M. Holcombe, X-machines as a basis for dynamic system specification, Software Engineering Journal, 3, 2 (1988), 69–76.

    Article  Google Scholar 

  11. M. Holcombe, Computational models of cells and tissues: Machines, agents and fungal infection, Briefings in Bioinformatics, 2 (2001), 271–278.

    Article  Google Scholar 

  12. M. Holcombe, What are X-machines, Formal Aspects of Computing, 12 (2000), 418–422.

    Article  MATH  Google Scholar 

  13. M. Holcombe, F. Ipate, Correct Systems Building a Business Process Solution, Springer, Applied Computing Series, 1998.

    Google Scholar 

  14. K. Jensen, Coloured Petri Nets-Basic Concepts, Analysis Methods and Practical Use, vol 1–3, Springer, Berlin, 1992, 1994, 1997.

    MATH  Google Scholar 

  15. S. Ji, The Bhopalator, An information/energy dual model of the living cell, Preproceedings of Workshop on Membrane Computing (WMC-CdeA2001) (C. Martin-Vide, Gh. Păun, eds), Curtea de Argeş, Romania, August 2001, 123–141, and Fundamenta Informaticae, 49 (2002), 147–165.

    Google Scholar 

  16. P. Kefalas, Formal modelling of reactive agents as an aggregation of simple behaviours, LNAI 2308 (I.P. Vlahavas, C.D. Syropoulos, eds.), Springer, 461–472, 2002.

    Google Scholar 

  17. Z. Kohavi, Switching and Finite Automata Theory, McGraw-Hill, 1978.

    Google Scholar 

  18. S.N. Krishna, R. Rama, On the power of P systems with sequential and parallel rewriting, Intern. J. Computer Math., 77, 1–2 (2000), 1–14.

    Google Scholar 

  19. S.N. Krishna, R. Rama, P systems with replicated rewriting, Journal of Automata, Languages and Combinatorics, 6 (2001), 345–350.

    MathSciNet  MATH  Google Scholar 

  20. A. Păun, P systems with string objects: Universality results, Pre-proceedings of Workshop on Membrane Computing (WMC-CdeA2001) (C. Martin-Vide, Gh. Păun, eds), Curtea de Arges, Romania, August 2001, 229–241.

    Google Scholar 

  21. Gh. Păun, Computing with membranes, Journal of Computer System Sciences, 61, 1 (2000), 108–143 (see also Turku Center for Computer Science, TUCS Report No 208, 1998, http://www.tucs).

    Article  MATH  Google Scholar 

  22. Gh. Păun, Membrane Computing. An Introduction, Springer, Berlin, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Sciences, Piteşti University, Str. Targu din Vale 1, 0300, Piteşti, Romania

    Tudor BĂlĂnescu & Florentin Ipate

  2. Department of Computer Science, Sheffield University, Regent Court, Portobello Street, S1 4DP, Sheffield, UK

    Marian Gheorghe & Mike Holcombe

Authors
  1. Tudor BĂlĂnescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marian Gheorghe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mike Holcombe
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Florentin Ipate
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700, Bucharest, Romania

    Gheorghe PĂun

  2. Leiden University, Leiden Institute of Advanced Computer Science, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

  4. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Via Bicocca degli Arcimboldi, 8, 20126, Milano, Italy

    Claudio Zandron

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

BĂlĂnescu, T., Gheorghe, M., Holcombe, M., Ipate, F. (2003). Eilenberg P Systems. In: PĂun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. WMC 2002. Lecture Notes in Computer Science, vol 2597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36490-0_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-36490-0_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00611-4

  • Online ISBN: 978-3-540-36490-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation