Sigrid Ewert

  • Citations Per Year
Learn More
Random context grammars belong to the class of context-free grammars with regulated rewriting. Their productions depend on context that may be randomly distributed in a sentential form. Context is classi ed as either permitting or forbidding, where permitting context enables the application of a production and forbidding context inhibits it. We concentrate(More)
While a 2-dimensional grid picture grammar may generate pictures (deened as subsets of the unit square) with arbitrarily small details, only a nite 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(More)
Regular tree grammars and top-down tree transducers are extended by random context sensitivity as known from the areas of string and picture generation. First results regarding the generative power of the resulting devices are presented. In particular, we investigate the path languages of random context tree languages. Copyright c © 2005 UMINF 05.02 ISSN(More)