Hyperedge replacement graph grammars
F Drewes, HJ Kreowski, A Habel - Handbook Of Graph Grammars …, 1997 - World Scientific
In this survey the concept of hyperedge replacement is presented as an elementary
approach to graph and hypergraph generation. In particular, hyperedge replacement graph …
approach to graph and hypergraph generation. In particular, hyperedge replacement graph …
[图书][B] Grammatical picture generation: A tree-based approach
F Drewes - 2006 - Springer
This book introduces the reader to the notions, the techniques, and the theory of
grammatical picture generation, a research field focusing on formal systems that describe …
grammatical picture generation, a research field focusing on formal systems that describe …
Local specification of surface subdivision algorithms
Many polygon mesh algorithms operate in a local manner, yet are formally specified using
global indexing schemes. This obscures the essence of these algorithms and makes their …
global indexing schemes. This obscures the essence of these algorithms and makes their …
[图书][B] Syntactic pattern recognition
M Flasiński - 2019 - World Scientific
Recognition is considered to be a basic human mental ability in psychology [Myers and
DeWall (2018); Reisberg (2013)]. It consists of identifying the objects (systems, processes …
DeWall (2018); Reisberg (2013)]. It consists of identifying the objects (systems, processes …
A unifying approach to picture grammars
M Pradella, A Cherubini, SC Reghizzi - Information and Computation, 2011 - Elsevier
Several old and recent classes of picture grammars, that variously extend context-free string
grammars in two dimensions, are based on rules that rewrite arrays of pixels. Such …
grammars in two dimensions, are based on rules that rewrite arrays of pixels. Such …
Tree-based picture generation
F Drewes - Theoretical Computer Science, 2000 - Elsevier
The concept of tree-based picture generation is introduced. It is shown that there are
equivalent tree-based definitions of four picture-generating devices known from the …
equivalent tree-based definitions of four picture-generating devices known from the …
Decidability of the finiteness of ranges of tree transductions
F Drewes, J Engelfriet - Information and Computation, 1998 - Elsevier
The finiteness of ranges of tree transductions is shown to be decidable for TBY+, the
composition closure of macro tree transductions. Furthermore, TBY+ definable sets and …
composition closure of macro tree transductions. Furthermore, TBY+ definable sets and …
Picture generation by collage grammars
F Drewes, HJ Kreowski - … Of Graph Grammars And Computing By …, 1999 - World Scientific
The purpose of this chapter is to give an introduction to collage grammars—picture
generating devices whose generation mechanism is based on hyperedge replacement as …
generating devices whose generation mechanism is based on hyperedge replacement as …
Parallel grammars: a phenomenology
H Fernau - Grammars, 2003 - Springer
The aim of this paper is at least 2 fold: to give prospective PhD students in the area hints at
where to start a promising research; and to supplement earlier reference lists on parallel …
where to start a promising research; and to supplement earlier reference lists on parallel …
Picture languages: From Wang tiles to 2D grammars
A Cherubini, M Pradella - International Conference on Algebraic …, 2009 - Springer
The aim of this paper is to collect definitions and results on the main classes of 2D
languages introduced with the attempt of generalizing regular and context-free string …
languages introduced with the attempt of generalizing regular and context-free string …