A property of random context picture grammars

摘要

We use random context picture grammers to generate pictures through successive refinement. The productions of such a grammar are context free, but their application is regulated by context randomly distributed in the developing picture. Grammars using this relatively weak context often succeed where context-free grammars fail, e.g., in generating the typical iteration sequence of the Sierpinski carpet. On the other hand, it proved possible to develop iteration theorems for three subclasses of these grammars; finding necessary conditions is problematic in the case of most models of context-free picture grammars with context-sensing ability, since they consider a variable and its context as a connected unit. We present a property of all picture sets generated with random context picture grammers, and then construct a picture set that does not belong to this class. (C) 2002 Elsevier Science B.V. All rights reserved. [References: 11]