4. GI Theorietag " Automaten und Formale Sprachen"

. We report on some new results obtained in investigating the generative power of #-context-free two-dimensional array productions (i. e. of two-dimensional array productions with the left hand side consisting of one non-terminal symbol surrounded by some blank symbols #, but with no restrictions imposed on the right hand side) in combination with well-known control mechanisms for regulated rewriting ([2]), i. e. in two-dimensional programmed array grammars and matrix array grammars as well as ordered array grammars. 1 Introduction By imposing specific restrictions on two-dimensional array productions regular, context-free, and monotonic two-dimensional array grammars are obtained. The corresponding families of two-dimensional array languages form a Chomskyhierarchy like in the string case ([1], [7]). Yet these results are obtained with a very restricted form of context-free two-dimensional array productions, i. e. with the right hand side being a finite connected pattern of non-blan..