Abstract
We propose a new type of computing devices based on grammatical formulation augmented by multiset storages, called chemical reaction regular grammars (CRRGs), and investigate some formal language theoretic characterizations of CRRGs including their generative capabilities. Shortly, a CRRG is a regular grammar with multisets, while its computational capability exhibits very intriguing aspects depending on the manners of rule applications. Firstly, we show that the class of languages (denoted by \(\mathcal {CRRL}^{\lambda }\)) generated by CRRGs coincides with the class of languages accepted by chemical reaction automata (Okubo and Yokomori in Nat Comput 15(2): 215–224, 2016), whose implication is that the computing power of CRRGs is also equivalent to that of several known devices introduced from different motivations such as Petri nets (Peterson in ACM Comput Surv 9(3):223–252, 1977) and partially blind 1-way multicounter machines (Greibach in Theor Comput Sci 7:311–324, 1979). Second, a new manner of rewriting strategy is integrated into CRRGs and we show that CRRGs working in maximal-sequential manner can generate any recursively enumerable language, which is an unexpected result with a surprise. In contrast, it is also shown that regulated controls due to regular sets and matrix constraints do not enhance the computing power of CRRGs. Third, for each \(k\ge 1\) a subclass of languages k-\(\mathcal {CRRL}^{\lambda }\) is considered, where k is the number of different symbols for multisets of CRRGs. We show that the class of languages is a full principal semi-AFL, which is obtained from a characterization result that L is in k-\(\mathcal {CRRL}^{\lambda }\) iff \(L=h(g^{-1}(B_k) \cap R)\) for some homomorphisms g, h, a regular set R, where \(B_k\) is a paritally balanced language over k-symbol alphabet.
Similar content being viewed by others
Notes
Note that a reaction of a reaction system in [5] is defined as a special case of \(\mathbf{a} = (R_\mathbf{a}, I_\mathbf{a}, P_\mathbf{a})\), where each component of a is a subset of S.
References
Araki, T., Kasami, T.: Some decision problems related to the reachability problem for Petri nets. Theoret. Comput. Sci. 3, 85–104 (1977)
Calude, C., Păun, Gh., Rozenberg, G., Salomaa, A. (Eds.): Multiset Processing, Lecture Notes in Computer Science vol. 2235, Springer (2001)
Daley, M., Eramian, M., McQuillan, I.: The Bag automaton: a model of nondeterministic storage. J. Automata Languages Combinator. 13, 185–206 (2008)
Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin (1989)
Ehrenfeucht, A., Rozenberg, G.: Reaction systems. Fund. Inform. 75, 263–280 (2007)
Ehrenfeucht, A., Rozenberg, G.: Events and modules in reaction systems. Theor. Comput. Sci. 376, 3–16 (2007)
Fernau, H., Stiebe, R.: Sequential grammars and automata with valences. Theor. Comput. Sci. 276, 377–405 (2002)
Fischer, P.C.: Turing machines with restricted memory access. Inf. Control 9(4), 364–379 (1966)
Fujioka, K.: Swarm-based multiset rewriting computing models. Lecture Notes in Computer Science vol. 11493, Springer, pp. 79–93 (2019) (Also, to appear in Natural Computing (2021))
Ginsburg, S., Greibach, S.: Principal AFL. J. Comput. Syst. Sci. 4(4), 308–338 (1970)
Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. Theor. Comput. Sci. 7, 311–324 (1979)
Hopcroft, J.E., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8, 135–159 (1979)
Hopcroft, J.E., Motwani, T., Ullman, J.D.: Introduction to Automata Theory, Language and Computation, 2nd edn. Addison-Wesley, Boston (2003)
Ibarra, O.H., McQuillan, I.: State grammars with stores. Theor. Comput. Sci. 798, 23–39 (2019)
Ibarra, O.H., Sahni, S.K., Kim, C.E.: Finite automata with multiplication. Theor. Comput. Sci. 2, 271–294 (1976)
Kudlek, M., Martin-Vide, C., Păun, Gh.: Toward a formal macroset theory. in: Multiset Processing, C. Calude, Gh. Păun, G. Rozenberg, A. Salomaa (Eds.), Lecture Notes in Computer Science vol. 2235, Springer, pp. 123–134 (2001)
Okubo, F.: On the computational power of reaction automata working in sequential manner. 4th Workshop on Non-Classical Models for Automata and Applications, book@ocg.at series 290, pp. 149–164, Osterreichische Computer Gesellschaft (2012) (Also, RAIRO Theoretical Informatics and Applications, vol. 48, pp. 23–38 (2014))
Okubo, F., Yokomori, T.: The computational capability of chemical reaction automata. Nat. Comput. 15(2), 215–224 (2016)
Okubo, F., Yokomori, T.: Morphic characterization of language families based on local and star languages. Fund. Inform. 154, 323–341 (2017)
Okubo, F., Yokomori, T.: The computing power of determinism and reversibility in chemical reaction automata. In: Adamatzky, A. (ed.) Reversibility and Universality. Emergence, Complexity and Computation, vol. 30, pp. 279–298. Springer, Cham (2018)
Okubo, F., Yokomori, T.: Decomposition and factorization of chemical reaction transducers. Theor. Comput. Sci. 777, 431–442 (2019)
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)
Peterson, J.L.: Computation sequence sets. J. Comput. Syst. Sci. 13, 1–24 (1976)
Peterson, J.L.: Petri nets. ACM Comput. Surv. 9(3), 223–252 (1977)
Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs (1981)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1998)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Yokomori, T., Okubo, F.: Theory of reaction automata: a survey. J. Membrane Comput. 3, 63–85 (2021)
Acknowledgements
The work of F. Okubo was in part supported by JSPS KAKENHI, Grants-in-Aid for Young Scientists (B) JP24700304. The work of T. Yokomori was in part supported by JSPS KAKENHI, Grant-in-Aid for Scientific Research (C) JP17K00021.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
About this article
Cite this article
Okubo, F., Fujioka, K. & Yokomori, T. Chemical Reaction Regular Grammars. New Gener. Comput. 40, 659–680 (2022). https://doi.org/10.1007/s00354-022-00160-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00354-022-00160-8