Proton Pumping P Systems

  • Artiom Alhazov
  • Matteo Cavaliere
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2933)


We propose here a (biologically inspired) model of P system called proton pumping P system that is a special case of evolution–communication P system. In cell biology there are transport mechanisms, involving protons. We generalize this idea by considering a few different types of protons. A proton pumping P system is, essentially, an evolution–communication P system where a special subset of symbol-objects (called protons) is used. In such a system we have simple evolution rules (classical evolution rules without target indications), symport and antiport rules that exchange some objects (among them, possibly, other protons) for a proton; taking inspiration from biology, this particular type of antiports is often called proton pumping rules.

We show that, as expected, the new model is universal, using non-cooperative rules, symport and antiport rules of weight one, and enough types of protons available for the computation. If we decrease the number of types of protons to one or two, then the model is at least as powerful as ET0L system, provided that (total) weak or strong priority of antiport rules over symport and evolution rules are used.

Finally, we consider some descriptional complexity measures (again, inspired from biology) for the newly introduced model.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alberts, B.: Essential Cell Biology. In: An Introduction to the Molecular Biology of the Cell. Garland Publ, New York (1998)Google Scholar
  2. 2.
    Alhazov, A.: Minimizing Evolution–Communication P Systems and EC P Automata. New Generation Computing (accepted)Google Scholar
  3. 3.
    Cavaliere, M.: Evolution–Communication P Systems. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 134–145. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)Google Scholar
  5. 5.
    Păun, G. (ed.): WMC 2002. LNCS, vol. 2597. Springer, Heidelberg (2003)Google Scholar
  6. 6.
    Saier jr., M.H.: A Functional-Phylogenetic Classification System for Transmembrane Solute Transporters. Microbiology and Molecular Biology Reviews, 354–411 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Artiom Alhazov
    • 1
    • 2
  • Matteo Cavaliere
    • 1
  1. 1.Research Group on Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain
  2. 2.Institute of Mathematics and Computer ScienceAcademy of Sciences of MoldovaChişinăuMoldova

Personalised recommendations