AbstractWe characterize the solutions of all the equations in two unknowns in the free partially commutative monoids, and we show that the connected solutions are cyclic. Next, we define the transposition relation (m and n are transposed iff m = xy and n = yx) and the conjugacy relation (m and n are conjugate iff mλ = λn). We show that the conjugacy is the transitive closure of the transposition and that the set of conjugacy factors is a recognizable subset of the free partially commutative monoïd
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Appli...
We consider the monoid T with the presentation which is "close" to trace monoids. We prove two diff...
AbstractWe define a Hopf algebra structure on the algebra of polynomials over a partially commutativ...
AbstractThe relations between graphs and their corresponding free partially commutative monoids are ...
AbstractRearrangements of words in a free monoid A∗ are considered and related to some equations in ...
AbstractLinear-time algorithms are presented for several problems concerning words in a partially co...
AbstractThis article characterizes the solutions of the commutativity equation xy = yx in free inver...
AbstractIt is shown that the set of overlaps of a connected word in a free partially commutative mon...
AbstractWe characterize here the free partially commutative monoids the regular sets of which form a...
AbstractIn this paper we evaluate the complexity of an algorithm for deciding whether a partially co...
AbstractThe two string-matching problems over free partially commutative monoids are studied and ana...
AbstractThis article characterizes the solutions of the commutativity equation xy = yx in free inver...
AbstractGiven a free partially commutative monoid, we interpret equivalence classes of words (also c...
AbstractA linear-time algorithm is given for the word problem for free partially commutative groups....
This article characterizes the solutions of the commutativity equation xy = yx in free inverse monoi...
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Appli...
We consider the monoid T with the presentation which is "close" to trace monoids. We prove two diff...
AbstractWe define a Hopf algebra structure on the algebra of polynomials over a partially commutativ...
AbstractThe relations between graphs and their corresponding free partially commutative monoids are ...
AbstractRearrangements of words in a free monoid A∗ are considered and related to some equations in ...
AbstractLinear-time algorithms are presented for several problems concerning words in a partially co...
AbstractThis article characterizes the solutions of the commutativity equation xy = yx in free inver...
AbstractIt is shown that the set of overlaps of a connected word in a free partially commutative mon...
AbstractWe characterize here the free partially commutative monoids the regular sets of which form a...
AbstractIn this paper we evaluate the complexity of an algorithm for deciding whether a partially co...
AbstractThe two string-matching problems over free partially commutative monoids are studied and ana...
AbstractThis article characterizes the solutions of the commutativity equation xy = yx in free inver...
AbstractGiven a free partially commutative monoid, we interpret equivalence classes of words (also c...
AbstractA linear-time algorithm is given for the word problem for free partially commutative groups....
This article characterizes the solutions of the commutativity equation xy = yx in free inverse monoi...
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Appli...
We consider the monoid T with the presentation which is "close" to trace monoids. We prove two diff...
AbstractWe define a Hopf algebra structure on the algebra of polynomials over a partially commutativ...