1) start with a single cell 2) create a cell if bottom neighbour is a cell
At every step our tower is growing
Reversal:
1) delete a cell if a cell doesn’t have a top neighbour
Destroy any cell with only a left neighbour. Create any cell with only a bottom neighbour.
Start with a single cell: in the forward direction a vertical tower appears. In the reverse direction a horizontal row appears.
_____
_____
__x__
_____
__x__
They are: _____
_____
__xx_
_____
__x__
and _____
_____
__xx_
_____
__xx_
Edit: Also, this has zero predecessors: _x
xx> In the reverse direction a horizontal row appears.
If you have a non-trivial row of live cells, then the cells immediately above that row will also become alive in the next (forward) instant. You end up with a row of N propagating upwards with a trail of rows of N-1.
I think your 1-cell example is actually a Garden of Eden in this rule -- there is no state that would produce it. The 1-cell itself isn't a still life, since as you note, it generates a vertical tower. Going backwards, a cell could only exist in the N+1'th state if it has a left neighbor in the N'th state; the only possible candidate for a predecessor would be the 2-cell row. But if we step this forward, we end up with three cells:
OO
OWhat's funny is we still don't have a counterexample of the broader notion, with finitely many cells turned on, in an infinite grid.