A CHARACTERIZATION OF CYCLE LENGTHS OF CELLULAR AUTOMATA

P. P. Chaudhuri, D. R. Chowdhury, S. Nandi and S. Chattopadhyay, Additive celullar automata theory and applications, 1, IEEE Computer Society Press, Los Alamitos, California, 1997.
A. K. Das, Additive cellular automata: Theory and application as a built-in self-test structure, PhD thesis, I.I.T., Kharagpur, India, 1990.
A. K. Das, A. Ganguly, A. Dasgupta, S. bhawmik and P. P. Chaudhuri, Efficient characterization of cellular automata, Proc. IEE (Part E) 15 (1990), no.1, 81-87.
B. Elspas, The theory of autonomous linear Sequential networks, TRE Trans. Circuits CT-6 (1959), 45-60.
P. D. Hortensius, R. D. McLeod and B. W. Podaima, Cellular automata circuits for built-in self test, IBM J. Res. & Dev. 34 (1990), 389-405. https://doi.org/10.1147/rd.342.0389
J. G. Kim, On state transition diagrams of cellular automata, East Asian Math. J. 25 (2009), no.4, 517-525.
S. Nandi, Additive cellular automata: Theory and application for testable circuit design and data encryption, PhD thesis, I.I.T., Kharagpur, India, 1994.
S. Nandi, B. K. Kar and P. P. Chaudhuri, Theory and applications of cellular automata in cryptography, IEEE Trans. Computers 43 (1994), no. 12, 1346- 1357. https://doi.org/10.1109/12.338094
W. Pries, A. Thanailakis and H. C. Card, Group properties of cellular automata and VLSI applications, IEEE Trans. Computers C-35 (1986), no. 12, 1013- 1024. https://doi.org/10.1109/TC.1986.1676709