1. Bauderon, M., Courcelle, B.: Graph expressions and graph rewritings. Mathematical Systems Theory 20(2-3), 83–127 (1987)
2. Blockeel, H., Brijder, R.: Learning non-confluent NLC graph grammar rules. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds.) 5th Conference on Computability in Europe (CiE 2009), Mathematical Theory and Computational Practice, Abstract Booklet, pp. 60–69 (2009)
3. Blockeel, H., Brijder, R.: Non-confluent NLC graph grammar inference by compressing disjoint subgraphs. Accepted for Journal of Logic and Computation. Preprint version: [arXiv:0901.4876] (2010)
4. Blockeel, H., Nijssen, S.: Induction of node label controlled graph grammar rules. In: Proceeding of the 6th International Workshop on Mining and Learning with Graphs, MLG 2008 (2008)
5. Cook, D., Holder, L.: Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research 1, 231–255 (1994)