Grids and universal computations on one-dimensional cellular automata

DOI10.1007/s11047-012-9312-2zbMath1339.68181OpenAlexW2036786645MaRDI QIDQ2629940

Jean-Baptiste Yunès

Publication date: 8 July 2016

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-012-9312-2

zbMATH Keywords

simulationcellular automatauniversality

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• On real-time cellular automata and trellis automata
• A six-state minimal time solution to the Firing squad synchronization problem
• Signals in one-dimensional cellular automata
• A universal cellular automaton in quasi-linear time and its S-m-n form
• Intrinsic Universality in Self-Assembly
• A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• STACS 2005
• Unnamed Item
• Unnamed Item

This page was built for publication: Grids and universal computations on one-dimensional cellular automata