Abstract
Efficient methods are given for finding the statistics of symbol blocks occuring in the graphs of additive cellular automata after large numbers of iterations. In particular, the methods yield fractal dimensions, entropies, and a recurrence relation for the number of nonzero symbols. The methods are based on the construction of a nonnegative integer matrix A closely related to the automation. The largest eigenvalue of A tells the fractal dimension, while the corresponding eigenvector gives the relative frequencies of blocks.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
