Abstract
Parallel/sequential generative models with tables are introduced and properties studied. These have higher generative capacity than our earlier matrix models which extend the essence of restricted parallelism to two dimensional grammars. The effects of appearance checking, minimal table and control are examined. The Szilard language of the vertical grammars is shown to be regular.