1. Decidability of the confluence of ground term rewriting systems;Dauchet,1987
2. Tree automata and decidability in ground terms rewriting systems;Dauchet,1985
3. Variations on the common subexpression problem;Downey;J. Assoc. Comput. Mach.,1980
4. Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time;Gallier,1988