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, pp.298-307, 2001.
DOI : 10.1109/SFCS.2001.959904

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

M. Dauchet and S. Tison, The theory of ground rewrite systems is decidable, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.242-248, 1990.
DOI : 10.1109/LICS.1990.113750

P. Donat-bouillud, F. Jacquemard, and M. Sakai, Towards an equational theory of rhythm notation, Music Encoding Conference, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01105418

I. Durand, G. Sénizergues, and M. Sylvestre, Termination of linear bounded term rewriting systems, Proceedings of the 21st Int. Conf. on Rewriting Techniques and Applications (RTA) of Leibniz International Proceedings in Informatics (LIPIcs), pp.341-356, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00506552

I. Durand and M. Sylvestre, Left-linear Bounded TRSs are Inverse Recognizability Preserving, 22nd RTA, pp.361-376, 2011.

G. Godoy, A. Tiwari, and R. Verma, On the Confluence of Linear Shallow Term Rewrite Systems, 20th Intl. Symposium on Theoretical Aspects of Computer Science (STACS), pp.85-96, 2003.
DOI : 10.1007/3-540-36494-3_9

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

G. Godoy and F. Jacquemard, Unique Normalization for Shallow TRS, 20th International Conference on Rewriting Techniques and Applications (RTA), pp.63-77, 2009.
DOI : 10.1007/11805618_26
URL : https://hal.archives-ouvertes.fr/inria-00578959

G. Godoy, R. Nieuwenhuis, and A. Tiwari, Classes of term rewrite systems with polynomial confluence problems, ACM Transactions on Computational Logic, vol.5, issue.2, pp.321-331, 2004.
DOI : 10.1145/976706.976712

G. Godoy and S. Tison, On the Normalization and Unique Normalization Properties of Term Rewrite Systems, Proc. 21st International Conference 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, Confluence of Shallow Right-Linear Rewrite Systems, 19th International Workshop of Computer Science Logic, CSL, pp.541-556, 2005.
DOI : 10.1007/11538363_37

L. Huang and D. Chiang, Better k-best parsing, Proceedings of the Ninth International Workshop on Parsing Technology, Parsing '05, pp.53-64, 2005.

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, P. Donat-bouillud, and J. Bresson, A Structural Theory of Rhythm Notation Based on Tree Representations and Term Rewriting, 5th International Conference on Mathematics and Computation in Music (MCM), 2015.
DOI : 10.1007/978-3-319-20603-5_1
URL : https://hal.archives-ouvertes.fr/hal-01138642

L. Kaiser, Confluence of Right Ground Term Rewriting Systems Is Decidable, International Conference on Foundations of Software Science and Computation Structures (Fossacs), pp.470-489, 2005.
DOI : 10.1007/978-3-540-31982-5_30

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

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

N. Radcliffe and R. M. Verma, Uniqueness of normal forms is decidable for shallow term rewrite systems, Conference on Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2010.

H. Seki, T. Takai, Y. Fujinaka, and Y. Kaji, Layered Transducing Term Rewriting System and Its Recognizability Preserving Property, Int. Conf. on Rewriting Techniques and Applications (RTA), pp.98-113, 2002.
DOI : 10.1007/3-540-45610-4_8

T. Takai, Y. Kaji, and H. Seki, Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability, 11th Int. Conf. on Rewriting Techniques and Applications (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

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

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.

R. Verma, New Undecidability Results for Properties of Term Rewrite Systems, Electronic Notes in Theoretical Computer Science, vol.290, pp.69-85, 2008.
DOI : 10.1016/j.entcs.2012.11.012

R. Verma, Complexity of normal form properties and reductions for term rewriting problems complexity of normal form properties and reductions for term rewriting problems, Fundamenta Informaticae, vol.92, issue.12, pp.145-168, 2009.

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

M. Rakesh, M. Verma, D. Rusinowitch, and . Lugiez, Algorithms and reductions for rewriting problems, Fundam. Inf, vol.46, pp.257-276, 2001.

A. Ycart, F. Jacquemard, J. Bresson, and S. Staworko, A Supervised Approach for Rhythm Transcription Based on Tree Series Enumeration, Proceedings of the 42nd International Computer Music Conference (ICMC). ICMA, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01315689