Number of Protons/Bi-stable Catalysts and Membranes in P Systems. Time-Freeness

@inproceedings{Alhazov2005NumberOP,
  title={Number of Protons/Bi-stable Catalysts and Membranes in P Systems. Time-Freeness},
  author={Artiom Alhazov},
  booktitle={Workshop on Membrane Computing},
  year={2005}
}
Proton pumping P systems are a variant of membrane systems with both rewriting rules and symport/antiport rules, where a set of objects called protons is distinguished, every cooperative symport or antiport rule involves a proton, but no rewriting rule does. Time-freeness property means the result of all computations does not depend on the time it takes to execute the rules. The goal of this article is to improve (showing that two membranes are sufficient) the known universality results on… CONTINUE READING
BETA

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

Number of Protons/Bi-stable Catalysts and Membranes in P Systems. Time-Freeness

  • A. Alhazov
  • Preproceedings of the Workshop on Membrane…
  • 2005
1 Excerpt

Some Universality Results on Evolution-Communication P Systems

  • S. N. Krishna, A. Păun
  • New Generation Computing 22,
  • 2004
2 Excerpts

Three Universality Results on P Systems

  • A. Păun
  • In [ 8 ] , 207 – 215 , and New Generation…
  • 2004

Păun (Eds.): Brainstorming Week on Membrane Computing

  • M. Cavaliere, C. Mart́ın-Vide, Gh
  • Technical Report 26/03,
  • 2003

Similar Papers

Loading similar papers…