Natural Computing

, Volume 11, Issue 1, pp 95–106 | Cite as

Sequential and maximally parallel multiset rewriting: reversibility and determinism

  • Artiom Alhazov
  • Rudolf Freund
  • Kenichi Morita


We study reversibility and determinism aspects and the strong versions of these properties of sequential multiset processing systems and of maximally parallel systems, from the computability point of view. In the sequential case, syntactic criteria are established for both strong determinism and strong reversibility. In the parallel case, a criterion is established for strong determinism, whereas strong reversibility is shown to be decidable. In the sequential case, without control all four classes—deterministic, strongly deterministic, reversible, strongly reversible—are not universal, whereas in the parallel case deterministic systems are universal. When allowing inhibitors, the first and the third class become universal in both models, whereas with priorities all of them are universal. In the maximally parallel case, strongly deterministic systems with both promoters and inhibitors are universal. We also present a few more specific results and conjectures.


Theoretical computer science Multiset processing Inhibitors Priorities P systems Reversibility Determinism Decidability Universality 



Artiom Alhazov gratefully acknowledges the support of the Japan Society for the Promotion of Science and the Grant-in-Aid for Scientific Research, project \(20\cdot08364\). He also acknowledges the support by the Science and Technology Center in Ukraine, project 4032.


  1. Alhazov A, Freund R, Morita K (2010) Reversibility and determinism in sequential multiset rewriting. In: Calude CS, Hagiya M, Morita K, Rozenberg G, Timmis J (eds) Unconventional computation 2010, Tokyo. Lecture notes in computer science, vol 6079. Springer, New York, pp 21–31Google Scholar
  2. Alhazov A, Morita K (2010) On reversibility and determinism in P systems. In: Păun G, Pérez-Jiménez MJ, Riscos-Núñez A, Rozenberg G, Salomaa A (eds) Membrane computing, 10th international workshop, WMC 2009, Curtea de Argeş, revised selected and invited papers. Lecture notes in computer science, vol 5957. pp 158–168Google Scholar
  3. Bennett CH (1973) Logical reversibility of computation. IBM J Res Dev 17:525–532zbMATHCrossRefGoogle Scholar
  4. Calude CS, Păun Gh (2004) Bio-steps beyond Turing. BioSystems 77:175–194CrossRefGoogle Scholar
  5. Dassow J, Păun Gh (1989) Regulated rewriting in formal language theory. In: EATCS monographs in theoretical computer science, vol 18. Springer, New YorkGoogle Scholar
  6. Fredkin E, Toffoli T (1982) Conservative logic. Int J Theor Phys 21:219–253zbMATHCrossRefMathSciNetGoogle Scholar
  7. Freund R, Ibarra OH, Păun Gh, Yen H-C (2005) Matrix Languages, Register Machines, Vector Addition Systems. In: Gutiérrez-Naranjo MA, Riscos-Núñez A, Romero-Campero FJ, Sburlan D (eds) RGNC report 01/2005. Third brainstorming week on membrane computing. University of Seville, Fénix Editora, Sevilla, pp 155–168Google Scholar
  8. Ibarra OH (2011) On strong reversibility in P systems and related problems. Int J Found Comput Sci 22(1):7–14Google Scholar
  9. Leporati A, Zandron C, Mauri G (2006) Reversible P systems to simulate Fredkin circuits. Fundam Inform 74(4):529–548zbMATHMathSciNetGoogle Scholar
  10. Minsky ML (1969) Computation: finite and infinite machines. Prentice-Hall, Englewood CliffsGoogle Scholar
  11. Morita K (1996) Universality of a reversible two-counter machine. Theor Comput Sci 168:303–320zbMATHCrossRefGoogle Scholar
  12. Morita K (2001) A simple reversible logic element and cellular automata for reversible computing. In: Margenstern M, Rogozhin Yu (eds) Proceedings of 3rd international conference on machines, computations, and universality. Lecture notes in computer science, vol 2055. Springer, New York. pp 102–113Google Scholar
  13. Morita K (2007) Simple universal one-dimensional reversible cellular automata. J Cell Autom 2:159–165zbMATHMathSciNetGoogle Scholar
  14. Morita K, Nishihara N, Yamamoto Y, Zhang Zh (1997) A hierarchy of uniquely parsable grammar classes and deterministic acceptors. Acta Inform 34(5):389–410CrossRefMathSciNetGoogle Scholar
  15. Morita K, Yamaguchi Y (2007) A universal reversible turing machine. In: Proceedings of 5th international conference on machines, computations, and universality. Lecture notes in computer science, vol 4664. Springer, New York, pp 90–98Google Scholar
  16. Păun Gh (2002) Membrane computing. An Introduction. Springer, BerlinzbMATHCrossRefGoogle Scholar
  17. P Systems Webpage.

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  • Artiom Alhazov
    • 1
    • 2
  • Rudolf Freund
    • 3
  • Kenichi Morita
    • 1
  1. 1.FCS, Department of Information Engineering, Graduate School of EngineeringHiroshima UniversityHigashi-HiroshimaJapan
  2. 2.Institute of Mathematics and Computer ScienceAcademy of Sciences of MoldovaChişinăuMoldova
  3. 3.Faculty of InformaticsVienna University of TechnologyViennaAustria

Personalised recommendations