  Combinatorial generation of expander families and Lindenmayer-style
development models are both parallel in nature. Both can be handled within
proposed parallel graph grammar formalism. Their first-order properties can
then be checked by encompassing the generated graph language into an
appropriate automatic structure.
