Stabilising shifts of finite type with cellular automata | Vidéo | Carmin.tv

00:00:00 / 00:00:00

Stabilising shifts of finite type with cellular automata

By Siamak Taati

Appears in collection : Complexity of Simple Dynamical Systems / Complexité des Systèmes Dynamiques Simples - Week 3

We say that a CA F stabilises an SFT X if (1) every element of X is a fixed point of F, and (2) starting from any finite perturbation of a configuration in X, the CA returns to X in finitely many steps. Does every SFT admit a stabilising CA? If so, what is the optimal stabilisation time for a given SFT? Do conjugate SFTs have the same optimal stabilisation times? What about stabilisation from random perturbations? I will present a joint work with Nazim Fatès and Irène Marcovici providing (partial) answers to these questions.

Information about the video

Date of recording 15/02/2024
Date of publication 27/02/2024
Institution CIRM
Licence CC BY NC ND
Language English
Audience Researchers, Graduate Students
Director(s) Guillaume Hennenfent
Format MP4

Citation data

DOI 10.24350/CIRM.V.20138603
Cite this video Taati, Siamak (15/02/2024). Stabilising shifts of finite type with cellular automata. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.20138603
URL https://dx.doi.org/10.24350/CIRM.V.20138603

Domain(s)

Bibliography

FATÈS, Nazim, MARCOVICI, Irène, et TAATI, Siamak. Self-stabilisation of cellular automata on tilings. Fundamenta Informaticae, 2022, vol. 185. - https://doi.org/10.3233/FI-222103

MSC codes

Document(s)

https://www.cirm-math.fr/RepOrga/3150/Slides/cirm-taati.pdf

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow

Copyright Carmin.tv 2025

Give feedback