Abstract
This paper surveys recent developments on the theory of reaction automata, which has been lately initiated in [17] to model and analyze in the computational framework the behaviors of biochemical reactions in nature. Reaction automata (RAs) have been proposed as computing models for accepting string languages. RAs may be taken as a kind of an extension of reaction systems in that they deal with multisets rather than (usual) sets being dealt with in reaction systems. A computation process by an RA is performed in such a way that after taking in the system an input symbol from the environment, the RA changes its state (represented by a multiset) by applying reaction rules to the multiset in the manner designated, where the maximally parallel manner is considered as well as the (usual) sequential manner. An input sequence of symbols is accepted if the RA stays in a final state (i.e., a designated multiset) at some moment after reading through the input. Thus, RAs may also be regarded as a variant of finite automata in which multisets are used to play a role of (unbounded number of) states. The presented results are all from [16–18] and include: RAs have the Turing universal computation power, the computation power of exponential-bounded RAs coincides with that of the linear-bounded Turing machines, the computation power of linear-bounded RAs is incomparable to that of pushdown automata. Further, the case for RAs with sequential mode of rule applications is also investigated.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alhazov, A., Verlan, S.: Minimization strategies for maximally parallel multiset rewriting systems. Theoret. Comput. Sci. 412, 1587–1591 (2011)
Calude, C., Păun, Gh, Rozenberg, G, Salomaa, A. (eds.): Multiset Processing. LNCS 2235, Springer, Berlin (2001)
Csuhaj-Varju, E., Ibarra, O.H., Vaszil, G.Y.: On the computational complexity of P automata. Nat. Comput. 5, 109–126 (2006)
Csuhaj-Varju, E., Oswald, M., Vaszil, Gy., P automata, in The Oxford Handbook of Membrane Computing, pp.145-167, 2010
Csuhaj-Varju, E., Vaszil, Gy.: P Automata or Purely Communicating Accepting P Systems, pp. 219–233. LNCS 2597, Springer, Berlin (2003)
Ehrenfeucht, A., Rozenberg, G.: Reaction systems. Fundam. Inf. 75, 263–280 (2007)
Ehrenfeucht, A., Rozenberg, G.: Events and modules in reaction systems. Theoret. Comput. Sci. 376, 3–16 (2007)
Ehrenfeucht, A., Rozenberg, G.: Introducing time in reaction systems. Theoret. Comput. Sci. 410, 310–322 (2009)
Ehrenfeucht, A., Main, M., Rozenberg, G.: Combinatorics of life and death in reaction systems. Int. J. Found. Comput. Sci. 21, 345–356 (2010)
Ehrenfeucht, A., Main, M., Rozenberg, G.: Functions defined by reaction systems. Int. J. Found. Comput. Sci. 22, 167–178 (2011)
Freund, R., Oswald, M.: A short note on analysing P systems. Bull. EATCS 79, 231–236 (2002)
Hopcroft, J.E., Motwani, T., Ullman, J.D.: Introduction to Automata Theory, Language and Computation, 2nd ed. Addison-Wesley, Reading (2003)
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, pp. 123–134. LNCS 2235, Springer, Berlin (2001)
Kudlek, M., Totzke, P., Zetzsche, G.: Properties of multiset language classes defined by multiset pushdown automata. Fundam. Inf. 93, 235–244 (2009)
Hirvensalo, M.: On probabilistic and quantum reaction systems. Theoret. Comput. Sci. 429, 134–143 (2012)
Okubo, F.: Reaction automata working in sequential manner. RAIRO Theor. Inf. Appl. 48, 23–38 (2014)
Okubo, F., Kobayashi, S., Yokomori, T.: Reaction automata. Theoret. Comput. Sci. 429, 247–257 (2012)
Okubo, F., Kobayashi, S., Yokomori, T.: On the properties of language classes defined by bounded reaction automata. Theoret. Comput. Sci. 454, 206–221 (2012)
Păun, Gh., Pérez-Jiménez, M.J.: P and dP automata: a survey. In: Calude, C., Rozenberg, G., Salomaa, A. (eds.) Maurer Festschrift. LNCS 6570, Springer, Berlin (2011)
Păun, Gh., Rozenberg, G., Salomaa, A. (eds.): Handbook of Membrane Computing. Oxford University Press, Oxford (2010)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 3. Springer, Berlin (1998)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Salomaa, A.: On State sequences defined by reaction systems. In: Constable, R.L., Silva A. (eds.) Logic and Program Semantics, pp. 271–282. LNCS 7230, Springer, Berlin (2012)
Salomaa, A.: Functions and sequences generated by reaction systems. Theor. Comput. Sci. 466, 871–96 (2012)
Suzuki, Y., Fujiwara, Y., Takabayashi, J., Tanaka,H.: Artificial Life applications of a class of P systems. In: Calude, C., Păun, Gh., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing, pp. 299–346. LNCS 2235, Springer, Berlin (2001)
Acknowledgments
The work of F. Okubo was in part supported by Grants-in-Aid for Young Scientists (B) No.24700304, Japan Society for the Promotion of Science. The work of T.Yokomori was in part supported by a Waseda University Grant for Special Research Projects: 2012B-050 and 2013B-063, and also by a Grant-in-Aid for Scientific Research on Innovative Areas "Molecular Robotics" (No.24104003) of the Ministry of Education, Culture, Sports, Science, and Technology, Japan.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Japan
About this chapter
Cite this chapter
Okubo, F., Yokomori, T. (2015). Recent Developments on Reaction Automata Theory: A Survey. In: Suzuki, Y., Hagiya, M. (eds) Recent Advances in Natural Computing. Mathematics for Industry, vol 9. Springer, Tokyo. https://doi.org/10.1007/978-4-431-55105-8_1
Download citation
DOI: https://doi.org/10.1007/978-4-431-55105-8_1
Published:
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-55104-1
Online ISBN: 978-4-431-55105-8
eBook Packages: EngineeringEngineering (R0)