5 citations · 14 across the 5 of their papers we have counts for
5 papers
-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…
On Factor Universality in Symbolic Spaces
Laurent Boyer, Guillaume Theyssier
The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on…
On Local Symmetries And Universality In Cellular Autmata
Laurent Boyer, Guillaume Theyssier
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours and…
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
Laurent Boyer, Victor Poupet, Guillaume Theyssier
We study the notion of limit sets of cellular automata associated with probability measures (mu-limit sets). This notion was introduced by P. Kurka and A. Maass. It is a refinement…