Abstract
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.
Cite
CITATION STYLE
Drewes, F., Ewert, S., Klempien-Hinrichs, R., & Kreowski, H. J. (2001). Computing raster images from grid picture grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2088, pp. 113–121). Springer Verlag. https://doi.org/10.1007/3-540-44674-5_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
