Abstract
A family of one-dimensional nite linear cellular automata with re ective boundary condition over the eld Zp is de ned. The generalizations are the radius and the eld that states take values. Here, we establish a connection between reversibility of cellular automata and the rule matrix of the cellular automata with radius three. Also, we prove that the reverse CA of this family again falls into this family.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
