Skip to main content
SpringerLink
Log in

On Reversible Cellular Automata with Finite Cell Array

  • Conference paper
Unconventional Computation (UC 2005)

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

Included in the following conference series:

Abstract

Discrete quantum cellular automata are cellular automata with reversible transition. This paper deals with 1d cellular automata with finite cell array and triplet local transition rules. We present the necessary condition of local transition rules for cellular automata to be reversible, and prove the reversibility of some cellular automata.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dow, R.A.: Additive Cellular Automata and Global Injectivity. Physica D 110, 67–91 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Goles, E., Martinez, S.: Neural and automata networks - dynamical behavior and applications. Kluwer Academic Publishers, Dordrecht (1990)

    MATH  Google Scholar 

  3. Inokuchi, S., et al.: Computational analysis of cellular automata with triplet transition rule. Research Reports on Information Science and Electrical Engineering of Kyushu University 1(1), 79–84 (1996) (in Japanese)

    Google Scholar 

  4. Inokuchi, S., Mizoguchi, Y.: Generalized Partitioned Quantum Cellular Automata and Quantization of Classical CA. Int. Journ. of Unconventional Computing 1, 149–160 (2005)

    Google Scholar 

  5. Kobuchi, Y., Nishio, H.: Some regular state sets in the system of one-dimensional iterative automata. Information Sciences 5, 199–216 (1973)

    Article  MathSciNet  Google Scholar 

  6. Lee, H.-Y., Kawahara, Y.: Transition diagrams of finite cellular automata. Bull. Inform. Cybernet. 28, 47–69 (1996)

    MATH  MathSciNet  Google Scholar 

  7. Morita, K., Harao, M.: Computation universality of one-dimensional reversible (injective) cellular automata. Transactions of the IEICE E 72, 758–762 (1989)

    Google Scholar 

  8. Watrous, J.: On one-dimensional quantum cellular automata. In: Proceedings on the 36th Annual Symposium on Foundations of Computer Science, pp. 528–537 (1995)

    Google Scholar 

  9. Wolfram, S.: Random sequence generation by cellular automata. Advances in Applied Mathematics 7, 123–169 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  10. Wolfram, S.: A New Kind of Science, pp. 435–457, 1017–1021. Wolfram Media, Inc., Illinois (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, Kyushu University 33, Fukuoka, 812-8581, Japan

    Shuichi Inokuchi & Yoshihiro Mizoguchi

  2. Department of Informatics, Kyushu University 33, Fukuoka, 812-8581, Japan

    Kazumasa Honda & Yasuo Kawahara

  3. School of Computer Engineering, Pusan National University, Pusan, 609-735, Korea

    Hyen Yeal Lee

  4. Oita National College of Technology, Oita, 870-0152, Japan

    Tatsuro Sato

Authors
  1. Shuichi Inokuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kazumasa Honda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hyen Yeal Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tatsuro Sato
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yoshihiro Mizoguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Yasuo Kawahara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Auckland, New Zealand

    Cristian S. Calude

  2. Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand

    Michael J. Dinneen

  3. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, BucureÅŸti, Romania

    Gheorghe Păun

  4. Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Seville, Avda. Reina Mercedes, 41012, Sevilla, Spain

    Mario J. Pérez-Jímenez

  5. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Inokuchi, S., Honda, K., Lee, H.Y., Sato, T., Mizoguchi, Y., Kawahara, Y. (2005). On Reversible Cellular Automata with Finite Cell Array. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G. (eds) Unconventional Computation. UC 2005. Lecture Notes in Computer Science, vol 3699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560319_13

Download citation

  • DOI: https://doi.org/10.1007/11560319_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29100-8

  • Online ISBN: 978-3-540-32022-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation