Abstract
Chemical reaction automata (CRAs) are computing models with multiset storage based on multiset rewriting introduced in Okubo, Yokomori, (DNA20, LNCS, vol. 8727, pp. 53–66, (2014), [25]). A CRA consists of a finite set of reactions (or pairs of multisets called reactants and products, respectively) and an initial multiset as well as a set of final multisets. Taking an input symbol in the current configuration (multiset) a CRA changes it into a new configuration. Thus, a CRA offers an automaton-like computing model to investigate the computational analysis of chemical reactions. On the other hand, since any (irreversible) Turing machine was proven to be effectively simulated by a reversible Turing machine in Bennett, (IBM J Res Dev, 17(6), 525–532, (1973), [4]), reversible computing has become a research field that has been receiving increased attention. In this paper we introduce the notions of determinism and reversibility into CRAs, and investigate the computational powers of those classes of CRAs in comparison with the language classes of Chomsky hierarchy. The computing power of reversible CRAs involves the physical realization of molecular programming of chemical reaction networks (Thachuk, Condon, DNA 18, LNCS, vol. 7433, pp. 135–149, (2012), [32]) with DNA strand displacement system implementation (Qian, Winfree, Science, 332, 1196–1201, (2011), [29]), and therefore, it is of great significance to elucidate the computing capabilities of both deterministic and reversible CRAs from the theoretical viewpoint of molecular computing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Angluin, D.: Inference of reversible languages. J. ACM 29(3), 741–765 (1982)
Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn Automata. No.YLEU/DCS/TR-1280, Department of Computer Science, Yale University, New Haven CT, USA (2003)
Alhazov, A., Freund, R., Morita, K.: Sequential and maximally parallel multiset rewriting: reversibility and determinism. Nat. Comput. 11, 95–106 (2012)
Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525–532 (1973)
Calude, C., Păun, Gh, Rozenberg, G.: In: Salomaa, A. (ed.) Multiset Processing. LNCS, vol. 2235. Springer, Heidelberg (2001)
Csuhaj-Varju, E., Vaszil, G.: P Automata or Purely Communicating Accepting P Systems. LNCS, vol. 2597, pp. 219–233. Springer, Berlin (2003)
Csuhaj-Varju, E., Vaszil, G.: P automata. In the Oxford Handbook of Membrane Computing, pp. 145–167. (2010)
Daley, M., Eramian, M., McQuillan, I.: The bag automaton: a model of nondeterministic storage. J. Autom. Lang. Comb. 13, 185–206 (2008)
Ehrenfeucht, A., Rozenberg, G.: Reaction systems. Fundam. Inform. 75, 263–280 (2007)
Fredkin, E., Toffoli, T.: Conservative logic. Int. J. Theor. Phys. 21(3/4), 219–253 (1982)
Hopcroft, J.E., Motwani, T., Ullman, J.D.: Introduction to automata theory, language and computation, 2nd edn. Addison-Wesley, Reading (2003)
Ibarra, O.: On strong reversibility in P systems and related problems. Int. J. Found. Comput. Sci. 22(1), 7–14 (2011)
Kudlek, M., Martin-Vide, C., Păun, Gh: Toward a formal macroset theory. In: Calude, C., Păun, Gh, Rozenberg, G., Salomaa, A. (eds.) Multiset Processing. LNCS, vol. 2235, pp. 123–133. Springer, Berlin (2001)
Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. Syst. Sci. 78, 1814–1827 (2012)
Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183–191 (1961)
Leporati, A., Zandron, C., Mauri, G.: Reversible P systems to simulate Fredkin circuits. Fundam. Inform. 74, 529–548 (2006)
Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible turing machines. Trans. IEICE Japan E72(3), 223–228 (1989)
Morita, K.: Universality of a reversible two-counter machine. Theor. Comput. Sci. 168, 303–320 (1996)
Morita, K.: Reversible computing and cellular automata - a survey. Theor. Comput. Sci. 395, 101–131 (2008)
Morita, K.: Two-way reversible multi-head finite automata. Fundam. Inform. 110(1–4), 241–254 (2011)
Nishida, T.Y.: Reversible P systems with symport/antiport Rules. In: Proceedings of the 10th Workshop on Membrane Computing, pp. 452–460 (2009)
Okubo, F.: Reaction automata working in sequential manner. RAIRO Theor. Inform. Appl. 48, 23–38 (2014)
Okubo, F., Kobayashi, S., Yokomori, T.: Reaction automata. Theor. Comput. Sci. 429, 247–257 (2012)
Okubo, F., Kobayashi, S., Yokomori, T.: On the properties of language classes defined by bounded reaction automata. Theor. Comput. Sci. 454, 206–221 (2012)
Okubo, F., Yokomori, T.: The computational capability of chemical reaction automata. In: Murata, S., Kobayashi, S. (eds.) DNA20. LNCS, vol. 8727, pp. 53–66. Springer, Switzerland (2014). Also, in Natural Computing, vol. 15, pp. 215–224. (2016)
Paun, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press, Inc., New York (2010)
Peterson, J.L.: Petri Net Theory and the Modelling of Systems. Prentice-Hall, Englewood Cliffs (1981)
Pin, J.E.: On Reversible Automata. In: Proceedings of LATIN ’92, 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, April 6-10, pp. 401–416 (1992)
Qian, L., Winfree, E.: Scaling up digital circuit computation with DNA strand displacement cascades. Science 332, 1196–1201 (2011)
Qian, L., Soloveichik, D., Winfree, E.: Efficient turing-universal computation with DNA polymers. In: Sakakibara, Y., Mi, Y. (eds.) DNA16. LNCS, vol. 6518, pp. 123–140. Springer, Heidelberg (2011)
Rozenberg, G., Back, T.: Section IV: molecular computation. In: Kok, J.N. (ed.) Handbook of Natural Computing, vol. 3, pp. 1071–1355. Springer, Berlin (2012)
Thachuk, C., Condon, A.: In: Stefanovic, D., Turberfield, A. (eds.) Space and energy efficient computation with DNA strand displacement systems. DNA 18. LNCS, vol. 7433, pp. 135–149. Springer, Heidelberg (2012)
Toffoli, T.: Computation and construction universality of reversible cellular automata. J. Comput. Syst. Sci. 15, 213–231 (1977)
Acknowledgements
The authors are deeply indebted to referees for their useful comments which greatly improved the consistency and readability of an earlier version of this paper.
The work of F. Okubo was in part supported by JSPS KAKENHI Grant Number JP16K16008, Japan Society for the Promotion of Science. The work of T.Yokomori was in part supported by a Grant-in-Aid for Scientific Research on Innovative Areas “Molecular Robotics”(No. 24104003) and JSPS KAKENHI, Grant-in-Aid for Scientific Research (C) 17K00021 of The Ministry of Education, Culture, Sports, Science, and Technology, Japan, and by Waseda University grant for Special Research Projects: 2016B-067, 2016K-100 and 2017K-121.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Okubo, F., Yokomori, T. (2018). The Computing Power of Determinism and Reversibility in Chemical Reaction Automata. In: Adamatzky, A. (eds) Reversibility and Universality. Emergence, Complexity and Computation, vol 30. Springer, Cham. https://doi.org/10.1007/978-3-319-73216-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-73216-9_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73215-2
Online ISBN: 978-3-319-73216-9
eBook Packages: EngineeringEngineering (R0)