On the construction of state diagrams for cellular automata with additive rules

DOI10.1016/S0020-0255(98)10085-3zbMath0952.68094OpenAlexW2015273476WikidataQ127172256 ScholiaQ127172256MaRDI QIDQ1818779

John G. Stevens

Publication date: 4 January 2000

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(98)10085-3

zbMATH Keywords

cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (5)

One-dimensional cellular automata with random rules: longest temporal period of a periodic solution ⋮ Periodic solutions of one-dimensional cellular automata with uniformly chosen random rules ⋮ Characteristic and minimal polynomials of linear cellular automata ⋮ Ducci sequences and cyclotomic fields ⋮ Iterations of linear maps over finite fields

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic properties of cellular automata
• Exact results for deterministic cellular automata with additive rules
• On characterization of cellular automata with matrix algebra
• Transient and cyclic behavior of cellular automata with null boundary conditions
• Statistical mechanics of cellular automata

This page was built for publication: On the construction of state diagrams for cellular automata with additive rules