Articles producció científica> Filologies Romàniques

Contextual partial commutations

  • Dades identificatives

    Identificador: imarina:9048008
    Handle: https://hdl.handle.net/20.500.11797/imarina9048008
    Autors:
    Resum:
    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\*.

  • Altres:

    Versió de l'article dipositat: info:eu-repo/semantics/publishedVersion
    Departament: Filologies Romàniques
    URL Document de llicència: https://repositori.urv.cat/ca/proteccio-de-dades/
    Autor/s de la URV: Choffrut, Christian; Mercas, Robert
    Resum: 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\*.
    Any de publicació de la revista: 2010
    Accès a la llicència d'ús: https://creativecommons.org/licenses/by/3.0/es/
    Pàgina inicial: 59
    Data d'alta del registre: 05/02/2021
    Pàgina final: 72
    Volum de revista: 12