Abstract
We study reversibility and determinism aspects of sequential multiset processing systems, and the strong versions of these properties.
Syntactic criteria are established for both strong determinism and for strong reversibility. It also shown that without control all four classes – deterministic, strongly deterministic, reversible, strongly reversible – are not universal, while allowing priorities or inhibitors the first and the third class become universal. Moreover, strongly deterministic multiset rewriting systems with priorities are also universal.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrigoroaiei, O., Ciobanu, G.: Dual P Systems. In: Corne, D.W., Frisco, P., Paun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2008. LNCS, vol. 5391, pp. 95–107. Springer, Heidelberg (2009)
Alhazov, A., Morita, K.: On Reversibility and Determinism in P Systems. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A. (eds.) Preproc. of Membrane Computing - 10th International Workshop, pp. 129–139
Bennett, C.H.: Logical Reversibility of Computation. IBM Journal of Research and Development 17, 525–532 (1973)
Calude, C., Păun, G.: Bio-steps beyond Turing. BioSystems 77, 175–194 (2004)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. In: EATCS Monographs in Theoretical Computer Science, vol. 18. Springer, Heidelberg (1989)
Fredkin, E., Toffoli, T.: Conservative Logic. Int. J. Theoret. Phys. 21, 219–253 (1982)
Freund, R., Ibarra, O.H., Păun, G., Yen, H.-C.: Matrix languages, register machines, vector addition systems. In: Proc. Third Brainstorming Week on Membrane Computing, Sevilla, pp. 155–168 (2005)
Ibarra, O.H.: On Strong Reversibility in P Systems and Related Problems (manuscript)
Leporati, A., Zandron, C., Mauri, G.: Reversible P Systems to Simulate Fredkin Circuits. Fundam. Inform. 74(4), 529–548 (2006)
Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
Morita, K.: Universality of a Reversible Two-Counter Machine. Theoret. Comput. Sci. 168, 303–320 (1996)
Morita, K.: A Simple Reversible Logic Element and Cellular Automata for Reversible Computing. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, p. 102. Springer, Heidelberg (2001)
Morita, K.: Simple Universal One-Dimensional Reversible Cellular Automata. J. Cellular Automata 2, 159–165 (2007)
Morita, K., Nishihara, N., Yamamoto, Y., Zhang, Z.: A Hierarchy of Uniquely Parsable Grammar Classes and Deterministic Acceptors. Acta Inf. 34(5), 389–410 (1997)
Morita, K., Yamaguchi, Y.: A Universal Reversible Turing Machine. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 90–98. Springer, Heidelberg (2007)
Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)
P systems webpage, http://ppage.psystems.eu/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alhazov, A., Freund, R., Morita, K. (2010). Reversibility and Determinism in Sequential Multiset Rewriting. In: Calude, C.S., Hagiya, M., Morita, K., Rozenberg, G., Timmis, J. (eds) Unconventional Computation. UC 2010. Lecture Notes in Computer Science, vol 6079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13523-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-13523-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13522-4
Online ISBN: 978-3-642-13523-1
eBook Packages: Computer ScienceComputer Science (R0)