1. A.V. Aho, M. Ganapathi: Efficient Tree Pattern Matching: An Aid to Code Generation. Proc. of the 12th ACM Symp. on Principles of Programming Languages, pp. 334–340, 1985
2. J. Börstler, U. Möncke, R. Wilhelm: Table Compression for Tree Automata. ACM Transactions on Programming Languages and Systems, Vol. 13, No. 3, July 1991, pp. 295–314
3. D. R. Chase: An improvement to bottom-up tree pattern matching. Proc. of 14th ACM Symposium on Principles of Programming Languages, pp. 168–177, 1987
4. M. Dauchet, A. Deruyver: Compilation of Ground Term Rewriting Systems and Applications. In Dershowitz (Ed.): Proceedings of the Conference: Rewriting Techniques and Applications, LNCS 355, pp. 556–558, Springer 1989
5. P.J. Downey, R. Sethi, E.R. Tarjan: Variations on the common subexpression problem. JACM 27 (1980), pp. 758–771