COMPLEXITY ANALYSIS OF TIME SERIES GENERATED BY ELEMENTARY CELLULAR AUTOMATA

摘要

Using the tools of distinct excluded blocks, computational search and symbolic dynamics, the classification problem of all 256 elementary cellular automata is discussed from the point of view of time series generated by them, and examples in each class are provided to explain the methods used.