Coherence of monoids by insertions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Coherence of monoids by insertions

Nohra Hage
  • Fonction : Auteur
  • PersonId : 974165
Philippe Malbos

Résumé

We introduce string data structures as combinatorial descriptions of structured words on totally ordered alphabets. The data can be described by words through a reading map and can be constructed by using an insertion algorithm. The insertion map defines a product on datum. We show that the associativity of this product, the cross-section property of the data structure, and the confluence of the rewriting system defined by the insertion map are equivalent properties. We make explicit a coherent presentation of the monoid presented by the data structure, made of generators, rewriting rules describing the insertion of letters in words and relations among the insertion algorithms.
Fichier principal
Vignette du fichier
coheInsert.pdf (419.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01895068 , version 1 (13-10-2018)

Identifiants

  • HAL Id : hal-01895068 , version 1

Citer

Nohra Hage, Philippe Malbos. Coherence of monoids by insertions. 7th International Workshop on Confluence, IWC 2018, Jul 2018, Oxford, United Kingdom. ⟨hal-01895068⟩
28 Consultations
23 Téléchargements

Partager

Gmail Facebook X LinkedIn More