4 citations · 4 across the 5 of their papers we have counts for
6 papers
Towards New Parity Rules with Asynchronous Updating Inspired by Fatès's Rule
Rolf Hoffmann
The parity problem in 1D Cellular Automata is a classifier based on a local rule. If the number of ones in a ring of binary cells is odd then the automaton shall converge to all-on…
Maximal Arrangement of Dominos in the Diamond
Dominique Désérable, Rolf Hoffmann, Franciszek Seredyński
"Dominos" are special entities consisting of a hard dimer-like kernel surrounded by a soft hull and governed by local interactions. "Soft hull" and "hard kernel" mean that the hull…
Global Cellular Automata GCA -- A Massively Parallel Computing Model
Rolf Hoffmann
The Global Cellular Automata (GCA) Model is a generalization of the Cellular Automata (CA) Model. The GCA model consists of a collection of cells which change their states dependin…
Forming Point Patterns by a Probabilistic Cellular Automata Rule
Rolf Hoffmann
The objective is to find a Cellular Automata rule that can form a 2D point pattern with a maximum number of points (1-cells). Points are not allowed to touch each other, they have…
On patterns and dynamics of Rule 22 cellular automaton
Genaro J. Martinez, Andrew Adamatzky, Rolf Hoffmann +2
Rule 22 elementary cellular automaton (ECA) has a 3--cell neighborhood, binary cell states, where a cell takes state `1' if there is exactly one neighbor, including the cell itself…
Cellular Automata Applications in Shortest Path Problem
Michail-Antisthenis I. Tsompanas, Nikolaos I. Dourvas, Konstantinos Ioannidis +3
Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components…