About 4-States Solutions to the Firing Squad Synchronization Problem

Authors:
Hiroshi Umeo;Jean-Baptiste Yunès;Naoki Kamikawa
Affiliations:
University of Osaka Electro-Communication, Osaka, Japan;LIAFA - Université Paris 7 Denis Diderot, Paris, France 75013;University of Osaka Electro-Communication, Osaka, Japan
Venue:
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Year:
2008

Citing 7
Cited 1

A six-state minimal time solution to the firing squad synchronization problem

Theoretical Computer Science
Seven-state solutions to the Firing Squad Synchronization Problem

Theoretical Computer Science
Non-Minimal Time Solutions for the Firing Sychronization Problem

Non-Minimal Time Solutions for the Firing Sychronization Problem
Computation: finite and infinite machines

Computation: finite and infinite machines
A 4-states algebraic solution to linear cellular automata synchronization

Information Processing Letters
A smallest five-state solution to the firing squad synchronization problem

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
A design of symmetrical six-state 3n-step firing squad synchronization algorithms and their implementations

ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry

A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem: A Geometrical Approach

Fundamenta Informaticae - Machines, Computations and Universality, Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem. These solutions are all built on top of some elementary algebraic cellular automata. Thus, this gives a very new insight on the problem and a more general way of computing on cellular automata.