Time-evolution of the Rule 150 cellular automaton activity from a Fibonacci iteration
Combinatorics
2010-03-11 v1 Dynamical Systems
Number Theory
Abstract
The total activity of the single-seeded cellular rule 150 automaton does not follow a one-step iteration like other elementary cellular automata, but can be solved as a two-step vectorial, or string, iteration, which can be viewed as a generalization of Fibonacci iteration generating the time series from a sequence of vectors of increasing length. This allows to compute the total activity time series more efficiently than by simulating the whole spatio-temporal process, or even by using the closed expression.
Keywords
Cite
@article{arxiv.math/0410429,
title = {Time-evolution of the Rule 150 cellular automaton activity from a Fibonacci iteration},
author = {Jens Christian Claussen},
journal= {arXiv preprint arXiv:math/0410429},
year = {2010}
}
Comments
4 pages (3 figs included)