Grids and universal computations on one-dimensional cellular automata

DOI10.1007/S11047-012-9312-2zbMATH Open1339.68181OpenAlexW2036786645MaRDI QIDQ2629940FDOQ2629940

Authors: 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

Recommendations

• Achieving universal computations on one-dimensional cellular automata
• Efficient unidimensional universal cellular automaton
• scientific article; zbMATH DE number 4195207
• Computations on one-dimensional cellular automata
• scientific article; zbMATH DE number 2086632

zbMATH Keywords

simulationcellular automatauniversality

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• Intrinsic universality in self-assembly
• STACS 2005
• A universal cellular automaton in quasi-linear time and its S-m-n form
• Title not available (Why is that?)
• Signals in one-dimensional cellular automata
• Title not available (Why is that?)
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• On real-time cellular automata and trellis automata
• A six-state minimal time solution to the Firing squad synchronization problem
• A simple \(n\)-dimensional intrinsically universal quantum cellular automaton

Cited In (2)

• Generalized Coordinates for Cellular Automata Grids
• Achieving universal computations on one-dimensional cellular automata

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

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