Skip to main content
Conference Proceedings

On reversible cellular automata with finite cell array

Lecture Notes in Computer Science (2005) 3699 130-141
DOI: 10.1007/11560319_13
3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Discrete quantum cellular automata are cellular automata with reversible transition. This paper deals with Id 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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Inokuchi, S., Honda, K., Lee, H. Y., Sato, T., Mizoguchi, Y., & Kawahara, Y. (2005). On reversible cellular automata with finite cell array. In Lecture Notes in Computer Science (Vol. 3699, pp. 130–141). Springer Verlag. https://doi.org/10.1007/11560319_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free