ctraces-28-04-09.pdf (322.64 kB)
Download fileContextual partial commutations
journal contribution
posted on 2017-03-31, 11:24 authored by Christian Choffrut, Robert MercasRobert MercasWe consider the monoid T with the presentation 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}*. © 2010 Discrete Mathematics and Theoretical Computer Science.
History
School
- Science
Department
- Computer Science