F. Baader and T. Nipkow, Term rewriting and all that, 1998.

H. Comon and F. Jacquemard, Ground reducibility is EXPTIME-complete. Information and Computation, pp.123-153, 2003.
DOI : 10.1109/lics.1997.614922
URL : https://hal.archives-ouvertes.fr/inria-00578859

G. Godoy and H. Hernández, Undecidable properties of flat term rewrite systems, Applicable Algebra in Engineering, Communication and Computing, vol.6, issue.1, 2008.
DOI : 10.1007/s00200-009-0097-1

G. Godoy, E. Huntingford, and A. Tiwari, Termination of Rewriting with Right-Flat Rules, 18th Int. Conf. Rewriting Techniques and Applications, pp.200-213, 2007.
DOI : 10.1007/978-3-540-73449-9_16

G. Godoy and S. Tison, On the Normalization and Unique Normalization Properties of Term Rewrite Systems, 21st Int. Conf. on Automated Deduction (CADE), pp.247-262, 2007.
DOI : 10.1007/978-3-540-73595-3_17
URL : https://hal.archives-ouvertes.fr/hal-00190004

G. Godoy and A. Tiwari, Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure, Intl. Joint Conf. on Automated Deduction (IJCAR), volume 3097 of LNAI, pp.91-106, 2004.
DOI : 10.1007/978-3-540-25984-8_5

G. Godoy and A. Tiwari, Confluence of Shallow Right-Linear Rewrite Systems, 19th Int. Workshop of Computer Science Logic (CSL), pp.541-556, 2005.
DOI : 10.1007/11538363_37

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

I. Mitsuhashi, M. Oyamaguchi, and F. Jacquemard, The Confluence Problem for Flat TRSs, Proc. 8th Intl. Conf. on Artificial Intelligence and Symbolic Computation, pp.68-81, 2006.
DOI : 10.1007/11856290_8
URL : https://hal.archives-ouvertes.fr/inria-00579010

T. Nagaya and Y. Toyama, Decidability for Left-Linear Growing Term Rewriting Systems, Information and Computation, vol.178, issue.2, pp.499-514, 2002.
DOI : 10.1006/inco.2002.3157

R. Nieuwenhuis, Basic paramodulation and decidable theories (extended abstract), LICS, pp.473-482, 1996.
DOI : 10.1109/lics.1996.561464

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

M. Sipser, Introduction to the Theory of Computation, ACM SIGACT News, vol.27, issue.1, 2006.
DOI : 10.1145/230514.571645

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

R. Verma, Complexity of normal form properties and reductions for rewriting problems, Fundamenta Informaticae, 2008.

R. Verma, New undecidability results for properies of term rewrite systems, 9th International workshop, RULE, pp.1-16, 2008.

R. Verma and A. Hayrapetyan, A new decidability technique for ground term rewriting systems with applications, ACM Transactions on Computational Logic, vol.6, issue.1, pp.102-123, 2005.
DOI : 10.1145/1042038.1042042

R. Verma and J. Zinn, A polynomial-time algorithm for uniqueness of normal forms of linear shallow term rewrite systems, In Symposium on Logic in Computer Science LICS, 2006.

Y. Wang and M. Sakai, Decidability of termination for semi-constructor trss, leftlinear shallow TRSs and related systems, 17th Int. Conf. RTA, pp.343-356, 2006.