Skip to main content
SpringerLink
Log in

Computing with Multisets: A Survey on Reaction Automata Theory

  • Conference paper
  • First Online:
Sailing Routes in the World of Computation (CiE 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10936))

Included in the following conference series:

  • 528 Accesses

Abstract

In Natural Computing research [18], as mathematical modeling tools of biochemical reactions, Ehrenfeucht and Rozenberg introduced a formal model called reaction systems [6] for investigating the functioning of the living cell, where two basic components (reactants and inhibitors) play a key role as a regulation mechanism in controlling interactions.

F. Okubo—The work of T.Yokomori was in part supported by JSPS KAKENHI, Grant-in-Aid for Scientific Research (C) JP17K00021, and by Waseda University grant for Special Research Project: 2017K-121. The work of F. Okubo was in part supported by JSPS KAKENHI Grant Number JP16K16008.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Angluin, D.: Inference of reversible languages. J. ACM 29(3), 741–765 (1982)

    Article  MathSciNet  Google Scholar 

  2. Alhazov, A., Freund, R., Morita, K.: Sequential and maximally parallel multiset rewriting: reversibility and determinism. Nat. Comput. 11, 95–106 (2012)

    Article  MathSciNet  Google Scholar 

  3. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525–532 (1973)

    Article  MathSciNet  Google Scholar 

  4. Calude, C.S., PÄ‚un, G., Rozenberg, G., Salomaa, A. (eds.): WMC 2000. LNCS, vol. 2235. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45523-X

    Book  Google Scholar 

  5. Csuhaj-Varju, E., Vaszil, G.: P automata. In: The Oxford Handbook of Membrane Computing, pp. 145–167 (2010)

    Google Scholar 

  6. Ehrenfeucht, A., Rozenberg, G.: Reaction systems. Fundam. Inform. 75, 263–280 (2007)

    MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  8. Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. Syst. Sci. 78, 1814–1827 (2012)

    Article  MathSciNet  Google Scholar 

  9. Okubo, F.: Reaction automata working in sequential manner. RAIRO Theor. Inform. Appl. 48, 23–38 (2014)

    Article  MathSciNet  Google Scholar 

  10. Okubo, F., Kobayashi, S., Yokomori, T.: Reaction automata. Theor. Comput. Sci. 429, 247–257 (2012)

    Article  MathSciNet  Google Scholar 

  11. Okubo, F., Kobayashi, S., Yokomori, T.: On the properties of language classes defined by bounded reaction automata. Theor. Comput. Sci. 454, 206–221 (2012)

    Article  MathSciNet  Google Scholar 

  12. Okubo, F., Yokomori, T.: The computational capability of chemical reaction automata. In: Murata, S., Kobayashi, S. (eds.) DNA 2014. LNCS, vol. 8727, pp. 53–66. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11295-4_4. Also, in Natural Computing, vol. 15, pp. 215–224 (2016)

    Chapter  Google Scholar 

  13. Okubo, F., Yokomori, T.: Recent developments on reaction automata theory: a survey. In: Suzuki, Y., Hagiya, M. (eds.) Recent Advances in Natural Computing. MI, vol. 9, pp. 1–22. Springer, Tokyo (2015). https://doi.org/10.1007/978-4-431-55105-8_1

    Chapter  Google Scholar 

  14. Okubo, F., Yokomori, T.: Finite automata with multiset memory: a new characterization of chomsky hierarchy. Fundam. Inform. 138, 31–44 (2015)

    MathSciNet  MATH  Google Scholar 

  15. Okubo, F., Yokomori, T.: The computing power of determinism and reversibility in chemical reaction automata. In: Adamatzky, A. (ed.) Reversibility and Universality. ECC, vol. 30, pp. 279–298. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-73216-9_13

    Chapter  Google Scholar 

  16. Paun, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press, Inc., New York (2010)

    Book  Google Scholar 

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

    MATH  Google Scholar 

  18. Rozenberg, G., Back, T., Kok, J.N. (eds.): Handbook of Natural Computing. Section IV: Molecular Computation, vol. 3, pp. 1071–1355. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-540-92910-9

    Book  Google Scholar 

  19. Thachuk, C., Condon, A.: Space and energy efficient computation with DNA strand displacement systems. In: Stefanovic, D., Turberfield, A. (eds.) DNA 2012. LNCS, vol. 7433, pp. 135–149. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32208-2_11

    Chapter  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Takashi Yokomori

  2. Faculty of Business Administration, Takachiho University, 2-19-1 Ohmiya, Suginami-ku, Tokyo, 168-8508, Japan

    Fumiya Okubo

Authors
  1. Takashi Yokomori
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fumiya Okubo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Takashi Yokomori .

Editor information

Editors and Affiliations

  1. Kiel University, Kiel, Germany

    Florin Manea

  2. Queens College, CUNY, Queens, New York, USA

    Russell G. Miller

  3. Kiel University, Kiel, Germany

    Dirk Nowotka

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yokomori, T., Okubo, F. (2018). Computing with Multisets: A Survey on Reaction Automata Theory. In: Manea, F., Miller, R., Nowotka, D. (eds) Sailing Routes in the World of Computation. CiE 2018. Lecture Notes in Computer Science(), vol 10936. Springer, Cham. https://doi.org/10.1007/978-3-319-94418-0_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94418-0_42

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94417-3

  • Online ISBN: 978-3-319-94418-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation