Contextual partial commutations
2010 ◽
Vol Vol. 12 no. 4
◽
Keyword(s):
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications International audience 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\*.
2010 ◽
Vol DMTCS Proceedings vol. AN,...
(Proceedings)
◽
Keyword(s):
Keyword(s):
2012 ◽
Vol DMTCS Proceedings vol. AR,...
(Proceedings)
◽
2003 ◽
Vol DMTCS Proceedings vol. AC,...
(Proceedings)
◽
Keyword(s):
2018 ◽
Vol 7
(1)
◽
pp. 1-20
◽
Keyword(s):
2020 ◽
Vol Special issue on...
◽
2019 ◽
Vol 2019
(1)
◽
pp. 000509-000514