Computing Raster Images from Grid Picture Grammars
Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans‐Jörg Kreowski · 2003
While a 2-dimensional grid picture grammar may generate pictures (defined as subsets of the unit square) with arbitrarily small details, only a finite number of them can be made visible as raster images for any given raster. We present an algorithm based on bottom-up tree automata which computes the set of all raster images of the pictures generated by a given grid picture grammar.