Characterization of 1-d Periodic Boundary Reversible CA

Authors:
Sukanta Das;Biplab K. Sikdar
Affiliations:
Department of Information Technology Bengal Engineering and Science University, Shibpur Howrah, West Bengal, India 711103;Department of Computer Science & Technology Bengal Engineering and Science University, Shibpur Howrah, West Bengal, India 711103
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 8
Cited 0

Ininvertible cellular automata: a review

Physica D
On the dynamical behavior of chaotic cellular automata

Theoretical Computer Science - Special issue: cellular automata
Design of Nonlinear CA Based TPG Without Prohibited Pattern Set In Linear Time

Journal of Electronic Testing: Theory and Applications
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures

Journal of Computer and System Sciences
Classification of CA rules targeting synthesis of reversible cellular automata

ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Synthesis of one-dimensional linear hybrid cellular automata

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Cellular automata-based pseudorandom number generators for built-in self-test

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper reports characterization of one dimensional 3-neighborhood periodic boundary cellular automata (CA). It targets characterization of CA rules for efficient synthesis of reversible CA. The concept of reachability tree, as it has been proposed in [Sukanta Das, Anirban Kundu, Biplab K. Sikdar, and P. Pal Chaudhuri. Design of Nonlinear CA Based TPG Without Prohibited Pattern Set In Linear Time. Journal of Electronic Testing: Theory and Applications, 21:95-109, January 2005; Sukanta Das and Biplab K. Sikdar. Classification of CA Rules Targeting Synthesis of Reversible Cellular Automata. In Proceedings of International Conference on Cellular Automata for Research and Industry, ACRI, France, pages 68-77, September 2006; Sukanta Das, Biplab K. Sikdar, and P. Pal Chaudhuri. Characterization of Reachable/Nonreachable Cellular Automata States. In Proceedings of Sixth International Conference on Cellular Automata for Research and Industry, ACRI, The Netherlands, pages 813-822, October 2004], is redefined to classify the CA rules that can form a reversible CA. Such classification also enables synthesis of a reversible periodic boundary CA in linear time.