Simulations for bootstrap cellular automata on an oriented square lattice are shown to be consistent with exact results on the critical threshold (p∞c = 1) and a finite size scaling bound. Regimes above, below and close to pc (for finite samples) are detailed and characterized by a wide choice of updating and coding algorithms.