UNIVERSAL CELLULAR AUTOMATON OVER A HEXAGONAL TILING WITH 3 STATES

DOI10.1142/S0218196701000486zbMath1024.68071OpenAlexW2032609439MaRDI QIDQ4786283

Anahí Gajardo, Eric Goles Chacc

Publication date: 15 December 2002

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196701000486

zbMATH Keywords

three-state three-neighbor cellular automaton

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (3)

A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior ⋮ Eric Goles ⋮ Reversible elementary triangular partitioned cellular automata and their complex behavior

Cites Work

• Simulations between cellular automata on Cayley graphs
• A Universal Four-State Cellular Computer

This page was built for publication: UNIVERSAL CELLULAR AUTOMATON OVER A HEXAGONAL TILING WITH 3 STATES