Classification of CA Rules Targeting Synthesis of Reversible Cellular Automata
This paper reports classification of CA (cellular automata) rules targeting efficient synthesis of reversible cellular automata. An analytical framework is developed to explore the properties of CA rules for 3-neighborhood 1-dimensional CA. It is found that in two-state 3-neighborhood CA, the CA rules fall into 6 groups depending on their potential to form reversible CA. The proposed classification of CA rules enables synthesis of reversible CA in linear time.
KeywordsCellular Automaton Cellular Automaton Group Rule State Transition Diagram Unique Node
Unable to display preview. Download preview PDF.
- 1.Cattel, K., Muzio, J.C.: Synthesis of One Dimensional Linear Hybrid Cellular Automata. IEEE Trans. on CAD 15, 325–335 (1996)Google Scholar
- 3.Das, S.: Theory and A pplications of Nonlinear C ellular Automata I n VLSI Design. PhD thesis, Bengal Engineering And Science University, Shibpur (2006)Google Scholar
- 5.Das, S., Sikdar, B.K., Chaudhuri, P.: Characterization of Reachable/Nonreachable Cellular Automata States. In: Proceedings of Sixth International Conference on Cellular Automata for Research and Industry, ACRI 2004, The Netherlands, October 2004, pp. 813–822 (2004)Google Scholar