Interaction and collaboration between humans and intelligent machines has become
increasingly important as machine learning methods move into real-world applications that …

We present a solution to the Firing Squad Synchronization Problem that works both in Von
Neumann and Moore neighborhood and whatever is the dimension of the space. That …

In this paper, we come back on the notion of local simulation allowing to transform a cellular
automaton into a closely related one with different local encoding of information. This notion …

In a previous work (see [3]) we presented a general scheme to solve the 1D Generalized
Firing Squad Synchronization Problem. We designed it in a modular way using the concept …

Abstract Firing Squad Synchronisation on Cellular Automata is the dynamical
synchronisation of finitely many cells without any prior knowledge of their range. This can be …

In a previous work (see [3]) we presented a general schema to solve the 1D Generalized
Firing Squad Synchronization Problem. We used a semantic approach and designed it in a …

Here we present a solution to the generalized firing squad synchronization problem that
works on some class of shapes in the hexagonal tiling of the plane. The solution is obtained …

Continuing our line of work on field based cellular automata programming we, here, focus
our attention on an implementation of Mazoyer's schema for cellular synchronization …

Maignan and Yunes have already investigated solutions to the generalized firing squad
synchronization problem for square tilings with both Moore and Von Neumann …

In this paper, we design a solution to the generalized firing squad problem where the
splittings can be chosen to happen at any ratio greater than two thirds. This is in the same …