Polygraphs of finite derivation type

Yves Guiraud 1, 2 Philippe Malbos 3
2 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique, Inria de Paris
3 AGL - Algèbre, géométrie, logique
ICJ - Institut Camille Jordan [Villeurbanne]
Abstract : Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he constructed finitely presentable monoids with a decidable word problem, but that cannot be presented by finite convergent rewriting systems. Later, he introduced the condition of finite derivation type, which is a homotopical finiteness property on the presentation complex associated to a monoid presentation. He showed that this condition is an invariant of finite presentations and he gave a constructive way to prove this finiteness property based on the computation of the critical branchings: being of finite derivation type is a necessary condition for a finitely presented monoid to admit a finite convergent presentation. This survey presents Squier's results in the contemporary language of polygraphs and higher-dimensional categories, with new proofs and relations between them.
Liste complète des métadonnées

Cited literature [31 references]  Display  Hide  Download

Contributor : Yves Guiraud <>
Submitted on : Tuesday, December 13, 2016 - 2:49:56 PM
Last modification on : Sunday, March 31, 2019 - 1:24:42 AM
Document(s) archivé(s) le : Tuesday, March 14, 2017 - 1:02:24 PM


Files produced by the author(s)



Yves Guiraud, Philippe Malbos. Polygraphs of finite derivation type. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2018, 28 (2), pp.155-201. ⟨10.1017/S0960129516000220⟩. ⟨hal-00932845v2⟩



Record views


Files downloads