Eilenberg P Systems

  • Tudor BĂlĂnescu
  • Marian Gheorghe
  • Mike Holcombe
  • Florentin Ipate
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2597)


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.


Defend Prose 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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.MATHGoogle Scholar
  2. 2.
    C. Calude, Gh. Păun, Computing with Cells and Atoms, Taylor and Francis, London, 2000.Google Scholar
  3. 3.
    E. Csuhaj-Varju, J. Dassow, J. Kelemen, Gh. Păun, Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon & Breach, London, 1994.MATHGoogle Scholar
  4. 4.
    J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer Verlag, Berlin, 1989.Google Scholar
  5. 5.
    S. Eilenberg, Automata, Languages and Machines, Academic Press, 1974.Google Scholar
  6. 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. 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. 8.
    M. Gheorghe, Generalised stream X-machines and cooperating grammar systems, Formal Aspects of Computing, 12 (2000), 459–472.MATHCrossRefGoogle Scholar
  9. 9.
    M. Gheorghe, M. Holcombe, P. Kefalas, Computational models of collective foraging, BioSystems, 61 (2001), 133–141.CrossRefGoogle Scholar
  10. 10.
    M. Holcombe, X-machines as a basis for dynamic system specification, Software Engineering Journal, 3, 2 (1988), 69–76.CrossRefGoogle Scholar
  11. 11.
    M. Holcombe, Computational models of cells and tissues: Machines, agents and fungal infection, Briefings in Bioinformatics, 2 (2001), 271–278.CrossRefGoogle Scholar
  12. 12.
    M. Holcombe, What are X-machines, Formal Aspects of Computing, 12 (2000), 418–422.MATHCrossRefGoogle Scholar
  13. 13.
    M. Holcombe, F. Ipate, Correct Systems Building a Business Process Solution, Springer, Applied Computing Series, 1998.Google Scholar
  14. 14.
    K. Jensen, Coloured Petri Nets-Basic Concepts, Analysis Methods and Practical Use, vol 1–3, Springer, Berlin, 1992, 1994, 1997.MATHGoogle Scholar
  15. 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. 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. 17.
    Z. Kohavi, Switching and Finite Automata Theory, McGraw-Hill, 1978.Google Scholar
  18. 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. 19.
    S.N. Krishna, R. Rama, P systems with replicated rewriting, Journal of Automata, Languages and Combinatorics, 6 (2001), 345–350.MathSciNetMATHGoogle Scholar
  20. 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. 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).MATHCrossRefGoogle Scholar
  22. 22.
    Gh. Păun, Membrane Computing. An Introduction, Springer, Berlin, 2002.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Tudor BĂlĂnescu
    • 1
  • Marian Gheorghe
    • 2
  • Mike Holcombe
    • 2
  • Florentin Ipate
    • 1
  1. 1.Faculty of SciencesPiteşti UniversityPiteştiRomania
  2. 2.Department of Computer ScienceSheffield UniversitySheffieldUK

Personalised recommendations