F. Baader and T. Nipkow, Term Rewriting and All That, 1998.

H. Comon, G. Godoy, and R. Nieuwenhuis, The confluence of ground term rewrite systems is decidable in polynomial time, Proceedings 2001 IEEE International Conference on Cluster Computing, 2001.
DOI : 10.1109/SFCS.2001.959904

H. Comon, M. Haberstrau, and J. Jouannaud, Syntacticness, Cycle-Syntacticness, and Shallow Theories, Information and Computation, vol.111, issue.1, pp.154-191, 1994.
DOI : 10.1006/inco.1994.1043
URL : http://doi.org/10.1006/inco.1994.1043

M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison, Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems, Information and Computation, vol.88, issue.2, pp.187-201, 1990.
DOI : 10.1016/0890-5401(90)90015-A

N. Dershowitz and J. Jouannaud, Rewrite Systems, In Handbook of Theoretical Computer Science, pp.243-320, 1990.
DOI : 10.1016/B978-0-444-88074-1.50011-1

G. Godoy and A. Tiwari, Confluence of Shallow Right-Linear Rewrite Systems, Computer Science Logic, 14th Annual Conf., CSL 2005, pp.541-556, 2005.
DOI : 10.1007/11538363_37

G. Godoy, A. Tiwari, and R. Verma, On the Confluence of Linear Shallow Term Rewrite Systems, In In Symp. on Theoretical Aspects of Computer Science LNCS, vol.2607, pp.85-96, 2003.
DOI : 10.1007/3-540-36494-3_9

F. Jacquemard, Reachability and confluence are undecidable for flat term rewriting systems, Information Processing Letters, vol.87, issue.5, pp.265-270, 2003.
DOI : 10.1016/S0020-0190(03)00310-7
URL : https://hal.archives-ouvertes.fr/inria-00578875

F. Jacquemard, Erratum to the paper: Reachability and confluence are undecidable for flat term rewriting system, 2005.

I. Mitsuhashi, M. Oyamaguchi, Y. Ohta, and T. Yamada, The Joinability and Related Decision Problems for Semi-constructor TRSs, IPSJ Digital Courier, vol.2, issue.5, 2006.
DOI : 10.2197/ipsjdc.2.222

I. Mitsuhashi, M. Oyamaguchi, and T. Yamada, The reachability and related decision problems for monadic and semi-constructor TRSs, Information Processing Letters, vol.98, issue.6
DOI : 10.1016/j.ipl.2006.02.014

T. Nagaya and Y. Toyama, Decidability for left-linear growing term rewriting systems, Proc.10th RTA, pp.256-270, 1999.
DOI : 10.1007/3-540-48685-2_22
URL : http://dx.doi.org/10.1006/inco.2002.3157

M. Oyamaguchi, The Church-Rosser property for ground term-rewriting systems is decidable, Theoretical Computer Science, vol.49, issue.1, pp.43-79, 1987.
DOI : 10.1016/0304-3975(87)90100-9

M. Oyamaguchi, The reachability and joinability problems for right-ground termrewriting systems, J.Inf.Process, vol.13, issue.3, pp.347-354, 1990.

K. Salomaa, Deterministic tree pushdown automata and monadic tree rewriting systems, Journal of Computer and System Sciences, vol.37, issue.3, pp.367-394, 1988.
DOI : 10.1016/0022-0000(88)90014-1
URL : http://doi.org/10.1016/0022-0000(88)90014-1

T. Takai, Y. Kaji, and H. Seki, Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability, Proc.11th RTA, pp.246-260, 2000.
DOI : 10.1007/10721975_17

A. Tiwari, Deciding confluence of certain term rewriting systems in polynomial time, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.447-456, 2002.
DOI : 10.1109/LICS.2002.1029852