Abstract
The probabilistic approach to deterministic cellular automata (CA) provides the possibility of understanding the properties of distribution of neighbourhoods in final patterns of CA systems exactly. Calculations made allow to find out not only qualitative but also quantitative explanation to the CA long time behaviour. They also give arguments for the dynamical classification of deterministic CA.
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
