Inducing an order on cellular automata by a grouping operation

DOI10.1016/S0166-218X(98)00125-5zbMath0924.68144MaRDI QIDQ1283794

K. Appert

Publication date: 10 November 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

cellular automaton

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items

Communication complexity and intrinsic universality in cellular automata ⋮ Bulking I: An abstract theory of bulking ⋮ Bulking II: Classifications of cellular automata ⋮ On hardest languages for one-dimensional cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern growth in elementary cellular automata
• Topological and measure-theoretic properties of one-dimensional cellular automata
• A linear speed-up theorem for cellular automata
• A universal cellular automaton in quasi-linear time and its S-m-n form
• On the Limit Sets of Cellular Automata
• The Nilpotency Problem of One-Dimensional Cellular Automata
• Simple Computation-Universal Cellular Spaces