3 problems

Let $X$ be a subshift of finite type (SFT), and consider deterministic cellular automata that stabilise $X$ from finite perturbations, possibly using additional symbols and allowin…

A 3-colouring is a colouring of the two-dimensional lattice using three colours, with the corresponding proper-colouring tiling space; a deterministic cellular automaton stabilises…

Let $\mathcal{H}_2=\{\underline{\mathtt{0}},\underline{\mathtt{1}}\}$ be the homogeneous two-dimensional tiling space, and consider the discrete-time version of the probabilistic c…