Fractal percolation and branching cellular automata (Q5944095)

In this paper under review, the authors develop a general theory of fractal percolation with neighbour interaction. They achieve this by way of the iteration of random substitutions, which they call a branching cellular automaton (BCA). The connection between BCA's and multi-type branching processes is investigated and plays a very important rôle in the paper. Each BCA is then associated with a sequence of random sets \(\{K_n\}\) in the Euclidean space. The authors prove a convergence theorem for \(\{K_n\}\) and calculate the Hausdorff dimension of the limiting set \(K\) (when it is not empty) or the boundary of \(K\). The latter is accomplished by showing that the boundary of a set generated by a BCA is again a set generated by a BCA.