A single-copy minimal-time simulation of a torus of automata by a ring of automata
From MaRDI portal
Publication:2384397
DOI10.1016/J.DAM.2007.05.019zbMATH Open1122.68474OpenAlexW2083642090MaRDI QIDQ2384397FDOQ2384397
Authors: Bruno Martin, Claudine Peyrat 
Publication date: 21 September 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.019
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Cellular automata (computational aspects) (68Q80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Amenable groups and cellular automata
- Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
- Title not available (Why is that?)
- A universal cellular automaton in quasi-linear time and its S-m-n form
- Title not available (Why is that?)
- A six-state minimal time solution to the Firing squad synchronization problem
- Reversible simulation of one-dimensional irreversible cellular automata
- A linear speed-up theorem for cellular automata
- Complexity and decidability
- Title not available (Why is that?)
- Simple 8-state minimal time solution to the firing squad synchronization problem
- The firing squad synchronization problem on Cayley graphs
- Embedding Torus Automata into a Ring of Automata
- A simulation of cellular automata on hexagons by cellular automata on rings
Cited In (1)
This page was built for publication: A single-copy minimal-time simulation of a torus of automata by a ring of automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384397)
