research paper review of automata theory and its application

automata theory Recently Published Documents

Total documents.

• Latest Documents
• Most Cited Documents
• Contributed Authors
• Related Sources
• Related Keywords

Problematic Cellular Automata Segmentation and Clusterization of a Region’s Geoinformation Space

Abstract We consider the problems of clustering and segmentation for objects in the geoinformation space using the cellular automata theory, both classical and non-orthogonal ones. We clarify the terminology associated with the use of hybrid software and hardware for processing information coming from sources of different physical nature. This research is based on the geometric clusterization methods of multidimensional real or virtual spaces. As illustrative examples we consider two and three-dimensional variants, which, from our point of view, does not reduce the results’ significance in relation to the space of a greater dimension. Based on the formation conditions of the geoinformation space model as a semantic system, the use of semantic interoperability of its properties and corresponding subspaces is justified. It is shown that the unified geographic information space (UGIS) can be the data source for the formation procedures of various problem-oriented clusters used to manage socio-economic objects. As a variant of the UGIS formed subspaces this study uses a digital plan-diagram that has proven its effectiveness during previous works on the analysis of territories during their space monitoring. We also pay attention to the use of fuzzy methods and models in the processing of fuzzy source data and the clusters formation. Specific examples of clustering and segmentation using classical and non-orthogonal cellular automata are given.

Separation for dot-depth two

The dot-depth hierarchy of Brzozowski and Cohen classifies the star-free languages of finite words. By a theorem of McNaughton and Papert, these are also the first-order definable languages. The dot-depth rose to prominence following the work of Thomas, who proved an exact correspondence with the quantifier alternation hierarchy of first-order logic: each level in the dot-depth hierarchy consists of all languages that can be defined with a prescribed number of quantifier blocks. One of the most famous open problems in automata theory is to settle whether the membership problem is decidable for each level: is it possible to decide whether an input regular language belongs to this level? Despite a significant research effort, membership by itself has only been solved for low levels. A recent breakthrough was achieved by replacing membership with a more general problem: separation. Given two input languages, one has to decide whether there exists a third language in the investigated level containing the first language and disjoint from the second. The motivation is that: (1) while more difficult, separation is more rewarding (2) it provides a more convenient framework (3) all recent membership algorithms are reductions to separation for lower levels. We present a separation algorithm for dot-depth two. While this is our most prominent application, our result is more general. We consider a family of hierarchies that includes the dot-depth: concatenation hierarchies. They are built via a generic construction process. One first chooses an initial class, the basis, which is the lowest level in the hierarchy. Further levels are built by applying generic operations. Our main theorem states that for any concatenation hierarchy whose basis is finite, separation is decidable for level one. In the special case of the dot-depth, this can be lifted to level two using previously known results.

Analysis of probabilistic processes and automata theory

Handbook of automata theory, desain game edukasi ilmu tajwid bagi anak usia dini menggunakan pemodelan finite state automata.

This study discusses how Finite State Automata (FSA) can be used as a model to design a Tajweed Science game application as a business diagram. This study aims to facilitate early childhood in learning the science of recitation by grouping hijaiyah letters into grouping the science of recitation by using a touch of the hand. The type of automata theory used is a non-deterministic finite automata with epsilon transition (E) or better known as E-NFA. Each transition, input, state that exists from the NFA, is basically to show the characteristics or states that occur in a game application. The importance of this research, in addition to learning recitation from an early age, is to show that automata theory can be used to help design a system in making game applications. The results of this Tajweed Science game application design are a rough display because there will still be further development stages and can ensure that game applications can be built from E-NFA modeling.

Special issue: Selected papers of the 13th International Conference on Language and Automata Theory and Applications, LATA 2019

Noncommutative rational pólya series.

AbstractA (noncommutative) Pólya series over a field K is a formal power series whose nonzero coefficients are contained in a finitely generated subgroup of $$K^\times $$ K × . We show that rational Pólya series are unambiguous rational series, proving a 40 year old conjecture of Reutenauer. The proof combines methods from noncommutative algebra, automata theory, and number theory (specifically, unit equations). As a corollary, a rational series is a Pólya series if and only if it is Hadamard sub-invertible. Phrased differently, we show that every weighted finite automaton taking values in a finitely generated subgroup of a field (and zero) is equivalent to an unambiguous weighted finite automaton.

Finite State Automata-Based Representation of Device States for Function Modeling of Multi-Modal Devices

Abstract Graph-based function models used in early-stage systems design usually represent only one operational mode of the system. Currently there is a need but no rigorous formalism to model multiple possible modes and states of a device in the same model and to perform model-based reasoning with that information such as predicting state transitions or causal propagations. This paper presents a formal representation of operational modes and states of technical devices based on automata theory for both discrete and continuous state transitions. It then presents formal definitions of three signal-processing verbs that actuate or regulate energy flows: Actuate_E, Regulate_E_Discrete, and Regulate_E_Continuous. The graphical templates, definitions, grammar rules, and application of each verb in modeling is illustrated. Finally, the representation is validated by implementing it on a graphical function modeling tool and using it to illustrate the verbs' modeling and reasoning ability for predicting mode and state transitions in response to control signals and cause-and-effect propagation throughout system-level models.

Hangman–Hangaroo Game Design Using Automata Theory

Automata theory plays an important role in various areas especially in game design. This paper describes the concept of automata theory in designing one of the most popular classical game which is Hangman. In this study, we focused on a game called Hangaroo, which implemented the same concept as in Hangman game. We studied and discussed the combination of automata and game theory that can be considered in order to design the game. As a result, we found that, automata theory is the fundamental access in designing and developing Games.

Automata Theory-based Energy Efficient Area Algorithm for an Optimal Solution in Wireless Sensor Networks

Export citation format, share document.

Design and Implementation of Ludo Game Using Automata Theory

Ieee account.

• Change Username/Password
• Update Address

Purchase Details

• Payment Options
• Order History
• View Purchased Documents

Profile Information

• Communications Preferences
• Profession and Education
• Technical Interests
• US & Canada: +1 800 678 4333
• Worldwide: +1 732 981 0060
• Contact & Support
• About IEEE Xplore
• Accessibility
• Terms of Use
• Nondiscrimination Policy
• Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. © Copyright 2024 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

Theory of reaction automata: a survey

• Survey Paper
• Published: 09 March 2021
• Volume 3 , pages 63–85, ( 2021 )

Cite this article

• Takashi Yokomori   ORCID: orcid.org/0000-0002-8384-0181 1 &
• Fumiya Okubo 2  

220 Accesses

Explore all metrics

In this paper, we survey on reaction automata theory to model and analyze the biochemical behaviors of vital reactions occurring in nature. Inspired by two notions of a reaction system initiated by Ehrenfeucht and Rozenberg in 2007 and of a multiset, reaction automata (RAs) have been proposed as computing models for accepting string languages. Given an input sequence of symbols, an RA performs its computation process as follows: at every time of receiving an input symbol, it changes the current configuration (represented by a multiset) by applying reaction rules to the multiset in a prescribed manner, for which two kinds of application manners are considered: the maximally parallel manner and the (usual) sequential manner. An RA functions as an extended finite automaton in which multisets play a role of (unbounded number of) states and the state transition is performed by applying reaction rules. We show that the computational powers of RAs are Turing universal in both manners of rule applications. The relationship between the space-bounded variants of RA and the Chomsky hierarchy is also discussed. Further, we discuss the notion of chemical reaction automata, which is a simplified variant of RAs with reaction rules that are free from inhibitor functioning. We complete this survey with a variety of related models of computing together with future research topics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price includes VAT (Russian Federation)

Instant access to the full article PDF.

Rent this article via DeepDyve

Institutional subscriptions

Similar content being viewed by others

Recent Developments on Reaction Automata Theory: A Survey

Computing with Multisets: A Survey on Reaction Automata Theory

The computational capability of chemical reaction automata.

Fumiya Okubo & Takashi Yokomori

(In the usual sense in space complexity theory).

Alhazov, A., Freund, R., Ivanov, S., Oswald, M., & Verlan, S. (2018). Chocolate P Automata. In C. Graciani, A. Riscos-Núñez, G. Păun, G. Rozenberg, & A. Salomaa (Eds.), Enjoying Natural Computing (Pérez-Jiménez Festschrift) (Vol. 11270, pp. 1–20)., Lecture Notes in Computer Science Berlin: Springer.

Google Scholar  

Alhazov, A., Freund, R., & Morita, K. (2012). Sequential and maximally parallel multiset rewriting: Reversibility and determinism. Natural Computing, 11 , 95–106.

MathSciNet   MATH   Google Scholar  

Alhazov, A., & Verlan, S. (2011). Minimization strategies for maximally parallel multiset rewriting systems. Theoretical Computer Science, 412 , 1587–1591.

Angluin, D. (1982). Inference of reversible languages. Journal of the ACM, 29 (3), 741–765.

Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M. J., & Peralta, R. (2006). Computation in networks of passively mobile finite-state sensors. Distributed Computing, 18 (4), 235–253.

MATH   Google Scholar  

Angluin, D., Aspnes, J., & Eisenstat, D. (2006). Stably computable predicates are semilinear. In: Proceedings of the 25th annual ACM symposium on principles of distributed computing, ACM Press, New York, pp. 292–299.

Angluin, D., Fischer, M.J., & Jiang, H. (2006). Stabilizing consensus in mobile networks. In: Proceedings of the second IEEE international conference on distributed computing in sensor systems (DCOSS’06), pp. 37–50.

Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., & Peralta, R. (2003). Urn automata. In: Technical report YALEU/DCS/TR-1280, Yale University, Department of Computer Science.

Bailey, N. T. J. (1975). The Mathematical Theory of Infectious Diseases (2nd ed.). London: Charles Griffin and Co.

Barbuti, R., Gori, R., Levi, F. L., & Milazzo, P. (2016). Investigating dynamic causalities in reaction systems. Theoretical Computer Science, 623 , 114–145.

Bennett, C. H. (1973). Logical reversibility of computation. IBM Journal of Research and Development, 17 (6), 525–532.

Brijder, R. (2019). Computing with chemical reaction networks: A tutorial. Natural Computing, 18 , 119–137.

MathSciNet   Google Scholar  

Burhard, H.-D. (1980). On priorities of parallelism: Petri nets under the maximum firing strategy. Logics of Programs and Their Applications, Lecture Notes in Computer Science, 148 , 86–97.

Calude, C., Păun, Gh, Rozenberg, G., & Salomaa, A. (Eds.). (2001). Multiset Processing (Vol. 2235)., Lecture Notes in Computer Science vol Berlin: Springer.

Chen, H.-L., Doty, D., & Soloveichik, D. (2012). Deterministic function computation with chemical reaction networks. Lecture Notes in Computer Science. In D. Stefanovic & A. Turberfield (Eds.), DNA 18, vol 7433 (pp. 25–42). Heidelberg: Springer.

Chomsky, N., & Schützenberger, M. P. (1963). The algebraic theory of context-free languages. Computer Programming and Formal Systems (pp. 118–161). Amsterdam: Elsevier.

Csuhaj-Varju, E., Ibarra, O. H., & Vaszil, Gy. (2006). On the computational complexity of P automata. Natural Computing, 5 , 109–126.

Csuhaj-Varju, E., Oswald, M., & Vaszil, Gy. (2010). P automata. The Oxford Handbook of Membrane Computing (pp. 145–167). Oxford: OUP.

Csuhaj-Varju, E., & Vaszil, Gy. (2003). P automata or purely communicating accepting P systems: Lecture Notes in Computer Science (Vol. 2597, pp. 219–233). Berlin: Springer.

Daley, D. J., & Kendall, D. G. (1965). Stochastic rumours. IMA Journal of Applied Mathematic, 1 , 42–55.

Daley, M., Eramian, M., & McQuillan, I. (2008). The Bag automaton: A model of nondeterministic storage. Journal of Automata, Languages and Combinatorics, 13 , 185–206.

Dennunzio, A., Formenti, E., Manzoni, L., & Porreca, A. E. (2019). Complexity of the dynamics of reaction systems. Information and Computation, 267 , 96–109.

Diamadi, Z., & Fischer, M. J. (2001). A simple game for the study of trust in distributed systems. Wuhan University Journal of Natural Sciences, 6 (1–2), 72–82. (March 2001. Also appears as Yale Technical Report TR-1207, January).

Eilenberg, S. (1974). Automata, Languages and Machines (Vol. A). New York: Academic Press.

Ehrenfeucht, A., & Rozenberg, G. (2007). Reaction systems. Fundamenta Informaticae, 75 , 263–280.

Ehrenfeucht, A., & Rozenberg, G. (2007). Events and modules in reaction systems. Theoretical Computer Science, 376 , 3–16.

Ehrenfeucht, A., & Rozenberg, G. (2009). Introducing time in reaction systems. Theoretical Computer Science, 410 , 310–322.

Ehrenfeucht, A., Main, M., & Rozenberg, G. (2010). Combinatorics of life and death in reaction systems. International Journal of Foundations of Computer Science, 21 , 345–356.

Ehrenfeucht, A., Main, M., & Rozenberg, G. (2011). Functions defined by reaction systems. International Journal of Foundations of Computer Science, 22 , 167–178.

Elsässer, R., & Radzik, T. (2018). Recent Results in Population Protocols for Exact Majority and Leader Election. In: Distributed Computing Column by Stefan Schmid, Bulletin of EATCS, vol 126.

Fredkin, E., & Toffoli, T. (1982). Conservative logic. International Journal of Theoretical Physics, 21 (3/4), 219–253.

Freund, R., & Oswald, M. (2002). A short note on analyzing P systems. Bulletin of the EATCS, 79 , 231–236.

Hack, M. (1976). Petri net languages, Technical Report 159 . Cambridge: MIT Press.

Hartmanis, J., & Sterns, R. E. (1966). Algebraic Structure Theory of Sequential Machines . Upper Saddle River: Prentice-Hall.

Hirvensalo, M. (2012). On probabilistic and quantum reaction systems. Theoretical Computer Science, 429 , 134–143.

Hopcroft, J. E., Motwani, T., & Ullman, J. D. (2003). Introduction to Automata Theory, Language and Computation - (2nd ed.). Boston: Addison-Wesley.

Ionescu, M., Păun, Gh, & Yokomori, T. (2006). Spiking neural P systems. Fundamenta Informaticae, 71 (2–3), 279–308.

Karp, R. M., & Miler, R. E. (1969). Parallel program schemata. Journal of Computer and System Sciences, 3 (2), 147–195.

Ibarra, O. H. (2011). On strong reversibility in P systems and related problems. International Journal of Foundations of Computer Science, 22 (1), 7–14.

Krohn, K., & Rhodes, J. (1965). Algebraic theory of machines I. Prime decomposition theorems for finite semigroups and machines. Transactions on American Mathematical Society, 116 , 450–464.

Kudlek, M., Martin-Vide, C., & Păun, Gh. (2001). Toward a formal macroset theory. In C. Calude, Gh Păun, G. Rozenberg, & A. Salomaa (Eds.), Multiset processing (Vol. 2235, pp. 123–134)., Lecture Notes in Computer Science Berlin: Springer.

Kudlek, M., Totzke, P., & Zetzsche, G. (2009). Properties of multiset language classes defined by multiset pushdown automata. Fundamenta Informaticae, 93 , 235–244.

Kutrib, M., & Malcher, A. (2012). Reversible pushdown automata. Journal of Computer and System Sciences, 78 , 1814–1827.

Liekens, A.M.L., & Fernando, C.T. (2007). Turing complete catalytic particle computers. In Proceedings of the 9th European Conference on Artificial Life (ECAL 2007), Lecture Notes in Computer Science, vol. 4648, Springer, Berlin, pp.1 202-1211.

McNaughton, R., & Papert, S. (1971). Counter-Free Automata . Cambridge: MIT Press.

Leporati, A., Zandron, C., & Mauri, G. (2006). Reversible P systems to simulate Fredkin circuits. Fundamenta Informaticae, 74 , 529–548.

Morita, K., Shirasaki, A., & Gono, Y. (1989). A 1-tape 2-symbol reversible Turing machines. Transactions of IEICE Japan, E72 (3), 223–228.

Morita, K. (2011). Two-way reversible multi-head finite automata. Fundamenta Informaticae, 110 (1-4), 241–254.

Nishida, T.Y. (2009). Reversible P systems with symport/antiport rules. In: Proceedings of the 10th workshop on membrane computing, pp. 452–460.

Nivat, M. (1968). Transductions des langages de Chomsky. Annales de l’institut Fourier, 18 , 339–456.

Okubo, F. (2014). On the computational power of reaction automata working in sequential manner. In: 4th Workshop on Non-Classical Models for Automata and Applications, [email protected] series 290, pp.149-164, Osterreichische Computer Gesellschaft, 2012. Also, RAIRO Theoretical Informatics and Applications, vol 48, pp. 23–38.

Okubo, F., Kobayashi, S., & Yokomori, T. (2012). Reaction automata. Theoretical Computer Science, 429 , 247–257.

Okubo, F., Kobayashi, S., & Yokomori, T. (2012). On the properties of language classes defined by bounded reaction automata. Theoretical Computer Science, 454 , 206–221.

Okubo, F., & Yokomori, T. (2015a). Recent developments on reaction automata theory : A survey. In Y. Suzuki & M. Hagiya (Eds.), Recent Advances in Natural Computing: Mathematics for Industry (Vol. 9, pp. 1–22). Tokyo: Springer.

Okubo, F., & Yokomori, T. (2015). Finite automata with multiset memory: A new characterization of Chomsky hierarchy. Fundamenta Informaticae, 138 , 31–44.

Okubo, F., & Yokomori, T. (2016). The computational capability of chemical reaction automata. Natural Computing, 15 (2), 215–224.

Okubo, F., & Yokomori, T. (2017). Morphic characterization of language families based on local and star languages. Fundamenta Informaticae, 154 , 323–341.

Okubo, F., & Yokomori, T. (2018). The computing power of determinism and reversibility in chemical reaction automata. In A. Adamatzky (Ed.), Reversibility and Universality: Emergence, Complexity and Computation (Vol. 30, pp. 279–298). Cham: Springer.

Okubo, F., & Yokomori, T. (2018). Computing with multisets: A survey on reaction automata theory. In F. Manea, R. Miller, & D. Nowotka (Eds.), Sailing Routes in the World of Computation: CiE 2018 (Vol. 10936, pp. 421–431)., Lecture Notes in Computer Science Cham: Springer.

Okubo, F., & Yokomori, T. (2019). Decomposition and factorization of chemical reaction transducers. Theoretical Computer Science, 777 , 431–442.

Păun, Gh. (2000). Computing with membrane. Journal of Computer and System Sciences, 61 (1), 108–143.

Păun, Gh. (2002). Membrane Computing: An introduction . Berlin: Springer.

Păun, Gh, & Pérez-Jiménez, M. J. (2011). P and dP automata: A survey. In C. Calude, G. Rozenberg, & A. Salomaa (Eds.), Maurer Festschrift: Lecture Notes in Computer Science (Vol. 6570, pp. 102–115). Berlin: Springer.

Păun, Gh, & Pérez-Jiménez, M. J. (2012). P automata revisited. Theoretical Computer Science, 454 , 222–230.

Păun, Gh, Rozenberg, G., & Salomaa, A. (Eds.). (2010). Handbook of Membrane Computing . Oxford: Oxford University Press.

Peterson, J. L. (1977). Petri nets. ACM Computing Survey, 9 (3), 223–252.

Peterson, J. L. (1981). Petri Net Theory and the Modeling of Systems . Englewood Cliffs: Prentice-Hall.

Qian, L., Soloveichik, D., & Winfree, E. (2011). Efficient Turing-universal computation with DNA polymers: Lecture Notes in Computer Science vol 6518. In Y. Sakakibara & Y. Mi (Eds.), DNA16 (pp. 123–140). Heidelberg: Springer.

Reinhardt, K. (2008). Reachability in Petri nets with inhibitor arcs. Electronic Notes in Theoretical Computer Science, 223 , 239–264.

Reisig, W., & Rozenberg, G. (Eds.). (1998). Lectures on Petri nets I: Basic models: Lecture Notes in Computer Science (Vol. 1491) . Berlin: Springer.

Rozenberg, G., & Salomaa, A. (Eds.). (1998). Handbook of Formal Languages, 3 volumes . Berlin: Springer.

Salomaa, A. (1973). Formal Languages . New York: Academic Press.

Salomaa, A. (2012). On state sequences defined by reaction systems. In R. L. Constable & A. Silva (Eds.), Logic and Program Semantics: Lecture Notes in Computer Science (Vol. 7230, pp. 271–282). Berlin: Springer.

Salomaa, A. (2012). Functions and sequences generated by reaction systems. Theoretical Computer Science, 466 , 871–96.

Samuel Clamons, S., Qian, L., & Winfree, E. (2019). Programming and simulating chemical reaction networks on a surface. Journal of the Royal Society Interface . https://doi.org/10.1098/rsif.2019.0790 .

Article   Google Scholar  

Soloveichik, D., Cook, M., Winfree, E., & Bruck, J. (2008). Computation with finite stochastic chemical reaction networks. Natural Computing, 7 (4), 615–633.

Soloveichik, D., Seelig, G., & Winfree, E. (2010). DNA as a universal substrate for chemical kinetics. Proceedings of National Academy of Sciences, 107 (12), 5393–5398.

Suzuki, Y., Fujiwara, Y., Takabayashi, J., & Tanaka, H. (2001). Artificial life applications of a class of P systems: Abstract rewriting systems on multisets: Lecture Notes in Computer Science vol 2235. In C. Calude, G. Păun, G. Rozenberg, & A. Salomaa (Eds.), Multiset Processing (pp. 299–346). Heidelberg: Springer.

Thachuk, C., & Condon, A. (2012). Space and energy efficient computation with DNA strand displacement systems: Lecture Notes in Computer Science vol 7433. In D. Stefanovic & A. Turberfield (Eds.), DNA 18 (pp. 135–149). Heidelberg: Springer.

Download references

Acknowledgements

The work of T. Yokomori was in part supported by JSPS KAKENHI, Grant-in-Aid for Scientific Research (C) JP17K00021. 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.

Author information

Authors and affiliations.

Faculty of Education and Integrated Arts and Sciences, Waseda University, 1-6-1 Nishiwaseda, Shinjuku-ku, Tokyo, 169-8050, Japan

Takashi Yokomori

Nihon Pharmaceutical University, 10281, Komuro, lna-machi, Kitaadachi-gun, Saitama, 362-0806, Japan

Fumiya Okubo

You can also search for this author in PubMed   Google Scholar

Corresponding author

Correspondence to Takashi Yokomori .

Additional information

Publisher's note.

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Yokomori, T., Okubo, F. Theory of reaction automata: a survey. J Membr Comput 3 , 63–85 (2021). https://doi.org/10.1007/s41965-021-00070-6

Download citation

Received : 01 October 2020

Accepted : 19 January 2021

Published : 09 March 2021

Issue Date : March 2021

DOI : https://doi.org/10.1007/s41965-021-00070-6

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

• Reaction automata
• Chemical reaction automata
• Multiset computing
• Find a journal
• Publish with us
• Track your research