AbstractSome observations on products of primitive words are discussed. By these results, alternative proof is given for the Lyndon–Schützenberger Theorem, which says that every solution of the equation ambn=ck over Σ* is trivial
We investigate the solution set of the pseudoperiodic extension of the classical Lyndon and Sch"utze...
AbstractUsing the notions of conjugacy of morphisms and of morphisms preserving Lyndon words, we ans...
Fredricksen and Maiorana (1978) [2] prove that the concatenation of Lyndon words of length dividing ...
AbstractSome observations on products of primitive words are discussed. By these results, alternativ...
AbstractWe express any general characteristic sturmian word as a unique infinite non-increasing prod...
AbstractWe prove some new combinatorial properties of the set PER of all words w having two periods ...
AbstractA primitive word w is a Lyndon word if w is minimal among all its conjugates with respect to...
International audienceGiven a totally ordered alphabet A = {a1 < a2 < < aq}, a Lyndon word is a word...
AbstractWe give a short proof of a result by Weinbaum [Unique sunwords in nonperiodic words, Proc. A...
CombinatoricsInternational audienceIn a recent paper, Brlek, Jamet and Paquin showed that some extre...
AbstractAn alternative proof of Shyr–Yu theorem is given. Some generalizations are also considered u...
The Chen-Fox-Lyndon theorem states that every finite word over a fixed alphabet can be uniquely fact...
AbstractProuhet words are a natural generalization, over alphabets with more than two letters, of th...
AbstractGiven a free partially commutative monoid, we interpret equivalence classes of words (also c...
AbstractWe present combinatorial properties of Hall trees and Hall words. We give new proofs of the ...
We investigate the solution set of the pseudoperiodic extension of the classical Lyndon and Sch"utze...
AbstractUsing the notions of conjugacy of morphisms and of morphisms preserving Lyndon words, we ans...
Fredricksen and Maiorana (1978) [2] prove that the concatenation of Lyndon words of length dividing ...
AbstractSome observations on products of primitive words are discussed. By these results, alternativ...
AbstractWe express any general characteristic sturmian word as a unique infinite non-increasing prod...
AbstractWe prove some new combinatorial properties of the set PER of all words w having two periods ...
AbstractA primitive word w is a Lyndon word if w is minimal among all its conjugates with respect to...
International audienceGiven a totally ordered alphabet A = {a1 < a2 < < aq}, a Lyndon word is a word...
AbstractWe give a short proof of a result by Weinbaum [Unique sunwords in nonperiodic words, Proc. A...
CombinatoricsInternational audienceIn a recent paper, Brlek, Jamet and Paquin showed that some extre...
AbstractAn alternative proof of Shyr–Yu theorem is given. Some generalizations are also considered u...
The Chen-Fox-Lyndon theorem states that every finite word over a fixed alphabet can be uniquely fact...
AbstractProuhet words are a natural generalization, over alphabets with more than two letters, of th...
AbstractGiven a free partially commutative monoid, we interpret equivalence classes of words (also c...
AbstractWe present combinatorial properties of Hall trees and Hall words. We give new proofs of the ...
We investigate the solution set of the pseudoperiodic extension of the classical Lyndon and Sch"utze...
AbstractUsing the notions of conjugacy of morphisms and of morphisms preserving Lyndon words, we ans...
Fredricksen and Maiorana (1978) [2] prove that the concatenation of Lyndon words of length dividing ...
DOI
Add to ORKG