Sciweavers

TCS
2010
13 years 5 months ago
Adaptive star grammars and their languages
Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties...
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Ma...
19
Voted
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 6 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
FLAIRS
2003
13 years 8 months ago
MDL-Based Context-Free Graph Grammar Induction
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biase...
Istvan Jonyer, Lawrence B. Holder, Diane J. Cook