1. B. Courcelle, M. Mosbah: Monadic second-order evaluations on treedecomposable graphs. Tech. Report LaBRI No. 90-110, Bordeaux, 1990
2. F. Gecseg, M. Steinby: Tree automata. Akademiai Kiado, Budapest, 1984
3. R. Giegerich, K. Schmal: Code selection techniques: pattern matching, tree parsing and inversion of derivors. Proc. of ESOP 1988, LNCS 300 pp. 245–268
4. A. Habel, H.-J. Kreowski, W. Vogler: Decidable boundedness problems for hyperedge-replacement grammars. Proc. TAPSOFT '89 vol. 1, LNCS 352, pp. 275–289; long version to appear in TCS
5. U. Möncke, R. Wilhelm: Iterative algorithms on grammar graphs. Proc. 8th Conf. on Graphtheoretic Concepts in Computer Science, Hanser Verlag 1982, pp. 177–194