Global properties of cellular automata (Q1099616)

Cellular automata are discrete mathematical systems that generate diverse, often complicated, behavior using simple deterministic rules. Analysis of the local structure of these rules makes possible a description of the global properties of the associated automata. A class of cellular automata that generate infinitely many aperiodic temporal sequences is defined, as is the set of rules for which inverses exist. Necessary and sufficient conditions are derived characterizing the classes of ``nearest-neighbor'' rules for whavailable net based tools. It is a compilation of information provided by tool authors or contact persons. A concise one page overview is provided as well.