Versión del articulo depositado: info:eu-repo/semantics/publishedVersion
Enlace a la fuente original: https://dmtcs.episciences.org/493
Departamento: Filologies Romàniques
URL Documento de licencia: https://repositori.urv.cat/ca/proteccio-de-dades/
Autor/es de la URV: Choffrut, Christian; Mercas, Robert
Resumen: 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\*.
Año de publicación de la revista: 2010
Acceso a la licencia de uso: https://creativecommons.org/licenses/by/3.0/es/
Página inicial: 59
Fecha de alta del registro: 05/02/2021
Página final: 72
Volumen de revista: 12