Counting Cycles in Reversible Cellular Automata

This paper reports characterization of 1-D cellular automata (CA) state space to count the cycles of reversible CA. The reachability tree provides theoretical framework to identify number of cycles in reversible CA. However, we concentrate here on a special class of reversible CA that follow right independence property. The right independence property implies, the cells of CA are independent of right neighbor. To our knowledge, no work till now has been done to find the number cycles of reversible CA by analyzing the CA state space.