AbstractA linear-time algorithm is given for the word problem for free partially commutative groups. The correctness of the algorithm follows from the fact that certain Thue systems, presenting such groups, are preperfect
AbstractThis paper studies two string matching problems over free partially commutative monoids. We ...
AbstractThe free partially commutative monoid M(A,Θ) defined by a set of commutation relations Θ on ...
AbstractFinite complete replacement systems over free partially commutative monoids have a decidable...
AbstractA linear-time algorithm is given for the word problem for free partially commutative groups....
AbstractLinear-time algorithms are presented for several problems concerning words in a partially co...
AbstractWe examine the idea of a free partially commutative, partially associative groupoid, and sho...
AbstractWe examine the idea of a free partially commutative, partially associative groupoid, and sho...
© Volker Diekert, Artur Jez, and Manfred Kufleitner. We give NSPACE(n log n) algorithms solving the ...
AbstractLinear-time algorithms are presented for several problems concerning words in a partially co...
AbstractThe two string-matching problems over free partially commutative monoids are studied and ana...
We give NSPACE(n*log(n)) algorithms solving the following decision problems. Satisfiability: Is the ...
AbstractIt is shown that the set of overlaps of a connected word in a free partially commutative mon...
AbstractWe characterize the solutions of all the equations in two unknowns in the free partially com...
AbstractLinear-time algorithms are given for the Word and Conjugacy Problems for trace monoids (or, ...
AbstractRearrangements of words in a free monoid A∗ are considered and related to some equations in ...
AbstractThis paper studies two string matching problems over free partially commutative monoids. We ...
AbstractThe free partially commutative monoid M(A,Θ) defined by a set of commutation relations Θ on ...
AbstractFinite complete replacement systems over free partially commutative monoids have a decidable...
AbstractA linear-time algorithm is given for the word problem for free partially commutative groups....
AbstractLinear-time algorithms are presented for several problems concerning words in a partially co...
AbstractWe examine the idea of a free partially commutative, partially associative groupoid, and sho...
AbstractWe examine the idea of a free partially commutative, partially associative groupoid, and sho...
© Volker Diekert, Artur Jez, and Manfred Kufleitner. We give NSPACE(n log n) algorithms solving the ...
AbstractLinear-time algorithms are presented for several problems concerning words in a partially co...
AbstractThe two string-matching problems over free partially commutative monoids are studied and ana...
We give NSPACE(n*log(n)) algorithms solving the following decision problems. Satisfiability: Is the ...
AbstractIt is shown that the set of overlaps of a connected word in a free partially commutative mon...
AbstractWe characterize the solutions of all the equations in two unknowns in the free partially com...
AbstractLinear-time algorithms are given for the Word and Conjugacy Problems for trace monoids (or, ...
AbstractRearrangements of words in a free monoid A∗ are considered and related to some equations in ...
AbstractThis paper studies two string matching problems over free partially commutative monoids. We ...
AbstractThe free partially commutative monoid M(A,Θ) defined by a set of commutation relations Θ on ...
AbstractFinite complete replacement systems over free partially commutative monoids have a decidable...
DOI
Add to ORKG