Special Issue
Cellular Automata Algorithms and Architectures (CAAA 2011)
Guest Editors
Dominique Désérable, Rolf Hoffmann and Genaro J. Martínez
p. 1-3
Preface
Dominique Deserable, Rolf Hoffmann & Genaro J. Martinez
Abstract
Full Text (IP)
p. 5-18
Determination of One-Way Bandwidth of Cellular Automata Using Binary Decision Diagrams
Andreas C. Doering
Abstract
Full Text (IP)
p. 19-38
A Fully Universal Turing Machine in Conway’s Game of Life
Paul Rendell
Abstract
Full Text (IP)
p. 39-51
An Optimum-Time Square Synchronization Algorithm:
One-Sided Recursive-Halving Marking Based
Hiroshi Umeo, Hiroki Uchino and Akira Nomura
Abstract
Full Text (IP)
p. 53-71
Logic Gates and Complex Dynamics in a Hexagonal Cellular Automaton:
The Spiral Rule
Rogelio Basurto, Paulina A. Leon, Genaro J. Martinez and Juan C. Seck-Tuoh-Mora
Abstract
Full Text (IP)
p. 73-89
Rectangular vs Triangular Routing with Evolved Agents
Patrick Ediger, Rolf Hoffmann and Dominique Deserable
Abstract
Full Text (IP)
p. 91-111
Cellular Automata-based Architecture for Cooperative Miniature Robots
Konstantinos Ioannidis, Georgios Ch. Sirakoulis and Ioannis Andreadis
Abstract
Full Text (IP)
p. 113-129
Cellular Automata and Naive Discrete Lines – I
Isabelle Debled-Rennesson and Maurice Margenstern
Abstract
Full Text (IP)