Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Exploring Millions of 6-State FSSP Solutions: the Formal Notion of Local CA Simulation

Abstract : 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 is used to explore solutions of the Firing Squad Synchronization Problem that are minimal both in time (2n − 2 for n cells) and, up to current knowledge, also in states (6 states). While only one such solution was proposed by Mazoyer since 1987, 718 new solutions have been generated by Clergue, Verel and Formenti in 2018 with a cluster of machines. We show here that, starting from existing solutions, it is possible to generate millions of such solutions using local simulations using a single common personal computer.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02605712
Contributor : Luidnel Maignan <>
Submitted on : Saturday, May 16, 2020 - 11:20:07 AM
Last modification on : Tuesday, May 19, 2020 - 1:16:20 AM

Files

AUTOMATA_20(2).pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02605712, version 1

Collections

Citation

Tien Thao Nguyen, Luidnel Maignan. Exploring Millions of 6-State FSSP Solutions: the Formal Notion of Local CA Simulation. 2020. ⟨hal-02605712⟩

Share

Metrics

Record views

84

Files downloads

31