On the Garden of Eden theorem for B-free subshifts
arXiv:2106.14673
Abstract
We prove that on B-free subshifts, with B satisfying the Erdös condition, all cellular automata are determined by monotone sliding block codes. In particular, this implies the validity of the Garden of Eden theorem for such systems.
23 pages