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

DOI10.1007/S00607-010-0096-XzbMATH Open1207.68218OpenAlexW2046001965MaRDI QIDQ985741FDOQ985741

Authors: Genaro J. Martínez, Norberto Hernández-Romero, 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

Recommendations

• Topological chaos of universal elementary cellular automata rule
• Universality in elementary cellular automata
• Determining a regular language by glider-based structures calles phases \(f_i\)\_1 in Rule 110
• Chaos emerged on the `edge of chaos'
• A concrete view of Rule 110 computation

zbMATH Keywords

elementary cellular automataproduction rulesblock substitution systemRule 110

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Representation of reversible cellular automata with block permutations
• Universality in elementary cellular automata
• Title not available (Why is that?)
• Determining a regular language by glider-based structures calles phases \(f_i\)\_1 in Rule 110
• P-completeness of Cellular Automaton Rule 110

Cited In (1)

• Simple block-substitution rule exhibits interesting patterns

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985741)