J. David and . Anick, On the homology of associative algebras, Trans. Amer. Math. Soc, vol.296, issue.2, pp.641-659, 1986.

R. Brown and J. Huebschmann, Identities among relations, Low-dimensional topology (Bangor, 1979), Soc. Lecture Note Ser, vol.48, pp.153-202, 1982.

F. Baader and T. Nipkow, Term rewriting and all that String-rewriting systems, Texts and Monographs in Computer Science, 1993.

S. Kenneth and . Brown, The geometry of rewriting systems: a proof of the Anick-Groves-Squier theorem, Algorithms and classification in combinatorial group theory, Math. Sci. Res. Inst. Publ, vol.23, pp.137-163, 1989.

A. Burroni, Higher-dimensional word problems with applications to equational logic, Theoretical Computer Science, vol.115, issue.1, pp.43-62, 1993.
DOI : 10.1016/0304-3975(93)90054-W
URL : http://doi.org/10.1016/0304-3975(93)90054-w

M. Barr and C. Wells, Category theory for computing science, Prentice Hall International Series in Computer Science, Theory and Applications of Categories, pp.1-538, 1990.

R. Cremanns and F. Otto, Finite Derivation Type Implies The Homological Finiteness Condition FP3, Journal of Symbolic Computation, vol.18, issue.2, pp.91-112, 1994.
DOI : 10.1006/jsco.1994.1039
URL : http://doi.org/10.1006/jsco.1994.1039

E. Daniel and . Cohen, A monoid which is right FP 8 but not left FP 1, Bull. London Math. Soc, vol.24, issue.4, pp.340-342, 1992.

S. Gaussent, Y. Guiraud, and P. Malbos, Coherent presentations of Artin monoids, Compositio Mathematica, vol.22, issue.05
DOI : 10.1090/pspum/056.2/1278735
URL : https://hal.archives-ouvertes.fr/hal-00682233

Y. Guiraud and P. Malbos, Higher-dimensional categories with finite derivation type, Theory Appl, Categ, vol.22, issue.18, pp.420-478, 2009.

Y. Guiraud, P. Malbos, and S. Mimram, A homotopical completion procedure with applications to coherence of monoids, Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics, pp.223-238, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00818253

R. J. John and . Groves, Rewriting systems and homology of groups, Groups ? Canberra, Lecture Notes in Math, vol.1456, pp.114-141, 1989.

[. Guiraud, Termination orders for three-dimensional rewriting, Journal of Pure and Applied Algebra, vol.207, issue.2, pp.341-371, 2006.
DOI : 10.1016/j.jpaa.2005.10.011

D. Knuth and P. Bendix, Simple word problems in universal algebras, Computational Problems in Abstract Algebra, Proc. Conf, pp.263-297, 1967.

[. Kapur and P. Narendran, A finite thue system with decidable word problem and without equivalent finite canonical system, Theoretical Computer Science, vol.35, issue.2-3, pp.337-344, 1985.
DOI : 10.1016/0304-3975(85)90023-4

Y. Kobayashi, Complete rewriting systems and homology of monoid algebras, Journal of Pure and Applied Algebra, vol.65, issue.3, pp.263-275, 1990.
DOI : 10.1016/0022-4049(90)90106-R

Y. Lafont and A. Prouté, Church-Rooser property and homology of monoids, Mathematical Structures in Computer Science, vol.21, issue.03, pp.297-326, 1991.
DOI : 10.1017/S096012950000133X

C. Roger, P. E. Lyndon, and . Schupp, Combinatorial group theory, Classics in Mathematics, 2001.

A. Markov, On the impossibility of certain algorithms in the theory of associative systems, Doklady Akad, Nauk SSSR (N.S.), vol.55, pp.583-586, 1947.

Y. Métivier, About the rewriting systems produced by the Knuth-Bendix completion algorithm, Information Processing Letters, vol.16, issue.1, pp.31-34, 1983.
DOI : 10.1016/0020-0190(83)90009-1

F. Métayer, Resolutions by polygraphs, Theory Appl, Categ, vol.11, issue.7, pp.148-184, 2003.

S. Mimram, Computing Critical Pairs in 2-Dimensional Rewriting Systems, Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics, vol.6, pp.227-242, 2010.

[. Lane, Categories for the working mathematician, 1998.
DOI : 10.1007/978-1-4612-9839-7

S. Mcglashan, E. Pasku, and S. J. Pride, FINITENESS CONDITIONS FOR REWRITING SYSTEMS, International Journal of Algebra and Computation, vol.15, issue.01, pp.175-205, 2005.
DOI : 10.1142/S0218196705002074

M. Newman, On Theories with a Combinatorial Definition of "Equivalence", The Annals of Mathematics, vol.43, issue.2, pp.43-223, 1942.
DOI : 10.2307/1968867

[. Otto, M. Katsura, and Y. Kobayashi, Infinite Convergent String-rewriting Systems and Cross-sections for Finitely Presented Monoids, Journal of Symbolic Computation, vol.26, issue.5, pp.621-648, 1998.
DOI : 10.1006/jsco.1998.0230

E. L. Post, Recursive Unsolvability of a problem of Thue, The Journal of Symbolic Logic, vol.1, issue.01, pp.1-11, 1947.
DOI : 10.1090/S0002-9904-1944-08111-1

J. Stephen and . Pride, Low-dimensional homotopy theory for monoids, Internat. J. Algebra Comput, vol.5, issue.6, pp.631-649, 1995.

C. Squier, F. Otto, and Y. Kobayashi, A finiteness condition for rewriting systems, Theoretical Computer Science, vol.131, issue.2, pp.271-294, 1994.
DOI : 10.1016/0304-3975(94)90175-9
URL : http://doi.org/10.1016/0304-3975(94)90175-9

C. Squier, Word problems and a homological finiteness condition for monoids, Journal of Pure and Applied Algebra, vol.49, issue.1-2, pp.201-217, 1987.
DOI : 10.1016/0022-4049(87)90129-0

[. Street, Limits indexed by category-valued 2-functors, Journal of Pure and Applied Algebra, vol.8, issue.2, pp.149-181, 1976.
DOI : 10.1016/0022-4049(76)90013-X
URL : http://doi.org/10.1016/0022-4049(76)90013-x