Papper version: info:eu-repo/semantics/publishedVersion
Link to the original source: https://dmtcs.episciences.org/493
Department: Filologies Romàniques
Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
URV's Author/s: Choffrut, Christian; Mercas, Robert
Abstract: 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\*.
Journal publication year: 2010
licence for use: https://creativecommons.org/licenses/by/3.0/es/
First page: 59
Record's date: 05/02/2021
Last page: 72
Journal volume: 12