MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENT

DOI10.1142/S0218196791000286MaRDI QIDQ4024639zbMATH OpenOpenAlexFDO

Authors Maxime Crochemore, Pavel Goralčík

Publication date 8 February 1993

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218196791000286

zbMATH Keywords

exponentfree semigroupindependent set of wordsternary words

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Free semigroups, generators and relations, word problems (20M05) Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 2186883
• Pattern avoidance in partial words over a ternary alphabet
• scientific article; zbMATH DE number 6982125
• scientific article; zbMATH DE number 7069752
• Avoiding letter patterns in ternary square-free words
• Binary avoidability and Thue-Morse words
• Lengths of extremal square-free ternary words
• Avoiding abelian powers in partial words
• Commutation with ternary sets of words
• SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS

Cited in

(5)

• On repetition-free binary words of minimal density
• On Dejean's conjecture over large alphabets
• scientific article; zbMATH DE number 3873334 (Why is no real title available?)
• On combinatorial properties of the Arshon sequence
• On a word avoiding near repeats

This page was built for publication: MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024639)