Free inverse monoids up to rewriting

David Janin 1, 2
1 PoSET - Models for a Structured Programming of Space and Time
LaBRI - Laboratoire Bordelais de Recherche en Informatique, SCRIME - Studio de Création et de Recherche en Informatique et Musique Électroacoustique, Inria Bordeaux - Sud-Ouest
Abstract : In this paper, generalizing the study of free partially commutative inverse monoids [5], for any rewriting system T over an alphabet A, we define the notion of T-compatible inverse A-generated monoids, we show there is a free T-compatible monoid FIM(A,T) generated by A and we provide an explicit construction of this monoid. Then, as examples, free partially commutative inverse monoid and free partially semi-commutative inverse monoids are studied and shown to have effective representations.
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download
Contributor : David Janin <>
Submitted on : Wednesday, August 5, 2015 - 5:38:23 PM
Last modification on : Tuesday, May 29, 2018 - 9:14:04 AM
Document(s) archivé(s) le : Wednesday, April 26, 2017 - 8:38:44 AM


Files produced by the author(s)


  • HAL Id : hal-01182934, version 1


David Janin. Free inverse monoids up to rewriting. [Research Report] LaBRI - Laboratoire Bordelais de Recherche en Informatique. 2015. ⟨hal-01182934⟩



Record views


Files downloads