Christian Choffrut ; Robert Mercas - Contextual partial commutations

dmtcs:493 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, Vol. 12 no. 4 -
Contextual partial commutationsArticle

Authors: Christian Choffrut 1; Robert Mercas ORCID2,3

  • 1 Laboratoire d'informatique Algorithmique : Fondements et Applications
  • 2 Research Group on Mathematical Linguistics
  • 3 Departament de Filologies Romàniques [Tarragona]

We consider the monoid T with the presentation < a, b; aab = aba > which is ''close'' to trace monoids. We prove two different types of results. First, we give a combinatorial description of the lexicographically minimum and maximum representatives of their congruence classes in the free monoid \a, b\* and solve the classical equations, such as commutation and conjugacy in T. Then we study the closure properties of the two subfamilies of the rational subsets of T whose lexicographically minimum and maximum cross-sections respectively, are rational in \a, b\*.

Volume: Vol. 12 no. 4
Published on: January 1, 2010
Imported on: March 26, 2015
Keywords: Contextual trace monoids,partial commutations,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 286 times.
This article's PDF has been downloaded 214 times.