5 citations · 5 across the 6 of their papers we have counts for
4 papers · 1 filter
Rice's theorem for generic limit sets of cellular automata
Martin Delacourt
The generic limit set of a cellular automaton is a topologically dened set of congurations that intends to capture the asymptotic behaviours while avoiding atypical ones. It was de…
-Limit Sets of Cellular Automata from a Computational Complexity Perspective
Laurent Boyer, Martin Delacourt, Victor Poupet +2
This paper concerns -limit sets of cellular automata: sets of configurations made of words whose probability to appear does not vanish with time, starting from an initial -ra…
Construction of -Limit Sets
Laurent Boyer, Martin Delacourt, Mathieu Sablik
The -limit set of a cellular automaton is a subshift whose forbidden patterns are exactly those, whose probabilities tend to zero as time tends to in- finity. In this article, f…
Directional Dynamics along Arbitrary Curves in Cellular Automata
Martin Delacourt, Victor Poupet, Mathieu Sablik +1
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellu…