Quadratic normalisation in monoids

Patrick Dehornoy 1 Yves Guiraud 2, 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
Abstract : In the general context of presentations of monoids, we study normalisation processes that are determined by their restriction to length-two words. Garside's greedy normal forms and quadratic convergent rewriting systems, in particular those associated with the plactic monoids, are typical examples. Having introduced a parameter called the class measuring the complexity of the normalisation of length-three words, we analyse the normalisation of longer words and describe a number of possible behaviours. We fully axiomatise normalisations of class (4, 3), show the convergence of the associated rewriting systems, and characterise those deriving from a Garside family.
Type de document :
Article dans une revue
International Journal of Algebra and Computation, World Scientific Publishing, 2016, 26 (5), pp.935-972. 〈10.1142/S0218196716500399〉
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01141226
Contributeur : Patrick Dehornoy <>
Soumis le : mercredi 11 mai 2016 - 16:21:06
Dernière modification le : mardi 26 septembre 2017 - 01:39:32
Document(s) archivé(s) le : mardi 16 août 2016 - 10:14:25

Fichier

Dip.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Patrick Dehornoy, Yves Guiraud. Quadratic normalisation in monoids. International Journal of Algebra and Computation, World Scientific Publishing, 2016, 26 (5), pp.935-972. 〈10.1142/S0218196716500399〉. 〈hal-01141226v2〉

Partager

Métriques

Consultations de la notice

169

Téléchargements de fichiers

68