Characteristic Representation of Elementary Cellular Automata

1993/11/06 by Yoshihiko Kayama, Y. Kayama, Honoka Anada +9
Computer Science · Physics and Astronomy · #Cellular Automata and Applications #Chaotic Dynamics (nlin.CD) #FOS: Physical sciences #chao-dyn #nlin.CD

paper · pdf · doi:10.48550/arxiv.chao-dyn/9311001

Latex

openalex publication_date 1993/11/06 · arxiv created 1993/11/13 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We propose a characteristic representation ofone-dimensional and 2-state, 3-neighbor cellular automaton rules, which describes an effective form of each rule after many time steps. Simulated results of the representation show that complex structures of Class IV rules come from their aspects of Class II and III. Class IV-like patterns can be generated by characteristic functions of a linear combenation of Class II and III rule functions.

Related

• New aspects of symmetry of elementary cellular automata
• A New Parameter F to Classify Cellular Automata Rule Table Space and a Phase Diagram in λ-F Plane
• Classification of Cellular Automata Rules Based on Their Properties
• Extension of cellular automata by introducing an algorithm of recursive estimation of neighbors
• Investigation of Rule 73 as Case Study of Class 4 Long-Distance Cellular Automata