Elementary cellular automaton Rule 110 explained as a block substitution system. Rule 110 as a block substitution system

DOI10.1007/S00607-010-0096-XzbMath1207.68218OpenAlexW2046001965MaRDI QIDQ985741

Norberto Hernández-Romero, Genaro J. Martínez, Joselito Medina-Marín, Juan Carlos Seck-Tuoh-Mora

Publication date: 6 August 2010

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-010-0096-x

zbMATH Keywords

elementary cellular automataproduction rulesblock substitution systemRule 110

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Cites Work

• P-completeness of Cellular Automaton Rule 110
• Representation of reversible cellular automata with block permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Elementary cellular automaton Rule 110 explained as a block substitution system. Rule 110 as a block substitution system