Abstract
This paper decides the behaviour of cellular automata, including the existence of fixed points and the order of configurations, using the poly nomial representation of configurations with respect to a basis derived from a series of state transition. We are mainly concerned with cellular automata with local transition rule 90 since the method described here can be used for any finite cellular automata with a little alternations [7].
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
