Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
Javra is a Java package for handling VRML scene graphs; it operates either stand-alone or in combination with a VRML browser. The combination of Javra and a VRML browser forms an ...
A high-level approach to describe the characteristics of a surface is to segment it into regions of uniform curehavior and construct an abstract representation given by a (topolog...
Fabien Vivodtzev, Lars Linsen, Georges-Pierre Bonn...
This paper outlines DIAPLAN, a visual rule-based programming language and environment that is based on the computational model of graph transformation. Thanks to its genericity, D...