1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.DS2025
Descriptive Complexity of Sensitivity of Cellular Automata
Tom Favereau, Ville Salo
We study the computational complexity of determining whether a cellular automaton is sensitive to initial conditions. We show that this problem is -complete in dimension 1 a…
math.DS2024★ 1 cited
Local generation of tilings: the even bicolor Wang tilesets
Tom Favereau, Mathieu Hoyrup
In this article, we apply the techniques developed in our previous article ``Local generation of tilings'', in which we introduced two definitions capturing the intuitive idea that…
math.DS2024
Local generation of tilings
Tom Favereau, Mathieu Hoyrup
In this article, we investigate the possibility of generating all the configurations of a subshift in a local way. We propose two definitions of local generation, explore their pro…