On Reversible Cellular Automata with Finite Cell Array

  • Shuichi Inokuchi
  • Kazumasa Honda
  • Hyen Yeal Lee
  • Tatsuro Sato
  • Yoshihiro Mizoguchi
  • Yasuo Kawahara
Conference paper

DOI: 10.1007/11560319_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3699)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Shuichi Inokuchi
    • 1
  • Kazumasa Honda
    • 2
  • Hyen Yeal Lee
    • 3
  • Tatsuro Sato
    • 4
  • Yoshihiro Mizoguchi
    • 1
  • Yasuo Kawahara
    • 2
  1. 1.Faculty of MathematicsKyushu University 33FukuokaJapan
  2. 2.Department of InformaticsKyushu University 33FukuokaJapan
  3. 3.School of Computer EngineeringPusan National UniversityPusanKorea
  4. 4.Oita National College of TechnologyOitaJapan

Personalised recommendations