  We prove the Garden of Eden theorem for cellular automata with finite set of
states and finite neighbourhood on right amenable left homogeneous spaces with
finite stabilisers. It states that the global transition function of such an
automaton is surjective if and only if it is pre-injective. Pre-Injectivity
means that two global configurations that differ at most on a finite subset and
have the same image under the global transition function must be identical.
