On reversible cellular automata with finite cell array

Authors:
Shuichi Inokuchi;Kazumasa Honda;Hyen Yeal Lee;Tatsuro Sato;Yoshihiro Mizoguchi;Yasuo Kawahara
Affiliations:
Faculty of Mathematics, Kyushu University 33, Fukuoka, Japan;Department of Informatics, Kyushu University 33, Fukuoka, Japan;School of Computer Engineering, Pusan National University, Pusan, Korea;Oita National College of Technology, Oita, Japan;Faculty of Mathematics, Kyushu University 33, Fukuoka, Japan;Department of Informatics, Kyushu University 33, Fukuoka, Japan
Venue:
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Year:
2005

Citing 4
Cited 0

Random sequence generation by cellular automata

Advances in Applied Mathematics
Neural and automata networks: dynamical behavior and applications

Neural and automata networks: dynamical behavior and applications
Additive cellular automata and global injectivity

Physica D
On one-dimensional quantum cellular automata

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.