Simulation of Parallel Automata in Growing Iterative Nets

The article describes a two-dimensional growing iterative net suitable for the simulation of a universal parallel automaton. The net has $L(n)\asymp n\cdot\log_2n$ active elements and a simulation dilation $T(n)\asymp\sqrt{n\log_2n}$, where $n$ is the number of elements of the parallel automaton in the simulated operating cycle.