Millions of 5-State $n^3$-Real Time Sequence Generators via Local Simulations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Millions of 5-State $n^3$-Real Time Sequence Generators via Local Simulations

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. In a previous paper, we applied it to the Firing Squad Synchronization Problem. In this paper, we show that the approach is not tied to this problem by applying it to the class of Real-Time Sequence Generation problems. We improve in particular on the generation of n3 sequence by using local mappings to obtain millions of 5-state solution, one of them using 58 transitions. It is based on the solution of Kamikawa and Umeo that uses 6 states and 74 transitions. Then, we explain in which sense even bigger classes of problems can be considered.
Not file

Dates and versions

hal-03937263 , version 1 (13-01-2023)

Identifiers

Cite

Tien Thao Nguyen, Luidnel Maignan. Millions of 5-State $n^3$-Real Time Sequence Generators via Local Simulations. 15th International Conference on Cellular Automata for Research and Industry, Bastien Chopard; Stefania Bandini; Alberto Dennunzio; Mira Arabi Haddad, Sep 2022, Genève, Switzerland. pp.83-93, ⟨10.1007/978-3-031-14926-9_8⟩. ⟨hal-03937263⟩
4 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More