AbstractHomotopy theory for monoid presentations originated by Squier is developed by means of homotopy reduction systems. Two types of asphericity are considered and a relation to the low-dimensional homology is established. If a monoid presentation has a complete homotopy reduction system that is essentially finite, then the monoid has the homology finiteness property FP4
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
One of the most used algorithm in rewriting theory is the Knuth-Bendix completion procedure which st...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
Recently, Craig Squier introduced the notion of finite derivation type to show that some finitely pr...
AbstractRecently, Craig Squier introduced the notion of finite derivation type to show that some fin...
In 1987, Craig Squier proved that, if a monoid can be presented by a finite convergent string rewrit...
International audienceCraig Squier proved that, if a monoid can be presented by a finite convergent ...
International audienceCraig Squier proved that, if a monoid can be presented by a finite convergent ...
International audienceCraig Squier proved that, if a monoid can be presented by a finite convergent ...
International audienceCraig Squier proved that, if a monoid can be presented by a finite convergent ...
AbstractA notion of finite derivation type (FDT) introduced by Squier is a finiteness property on ho...
AbstractThe homological finiteness propertyFP3and the combinatorial property of having finite deriva...
AbstractWe present a purely combinatorial approach to the question of whether or not a finitely pres...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
AbstractWe present a purely combinatorial approach to the question of whether or not a finitely pres...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
One of the most used algorithm in rewriting theory is the Knuth-Bendix completion procedure which st...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
Recently, Craig Squier introduced the notion of finite derivation type to show that some finitely pr...
AbstractRecently, Craig Squier introduced the notion of finite derivation type to show that some fin...
In 1987, Craig Squier proved that, if a monoid can be presented by a finite convergent string rewrit...
International audienceCraig Squier proved that, if a monoid can be presented by a finite convergent ...
International audienceCraig Squier proved that, if a monoid can be presented by a finite convergent ...
International audienceCraig Squier proved that, if a monoid can be presented by a finite convergent ...
International audienceCraig Squier proved that, if a monoid can be presented by a finite convergent ...
AbstractA notion of finite derivation type (FDT) introduced by Squier is a finiteness property on ho...
AbstractThe homological finiteness propertyFP3and the combinatorial property of having finite deriva...
AbstractWe present a purely combinatorial approach to the question of whether or not a finitely pres...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
AbstractWe present a purely combinatorial approach to the question of whether or not a finitely pres...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
One of the most used algorithm in rewriting theory is the Knuth-Bendix completion procedure which st...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...