  We prove that on B-free subshifts, with B satisfying the Erd\"os 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.
