On shortest crucial words avoiding abelian powers

DOI10.1016/J.DAM.2009.11.010MaRDI QIDQ968182zbMATH OpenOpenAlexFDO

Authors Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev, Sergey Avgustinovich

Publication date 5 May 2010

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://researchrepository.murdoch.edu.au/id/eprint/3362/

zbMATH Keywords

abelian powercrucial wordpattern avoidance

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Crucial Words for Abelian Powers
• Crucial abelian k-power-free words
• Avoidability of long k-abelian repetitions
• On some generalizations of abelian power avoidability
• Avoiding abelian powers cyclically

Cites work

• Crucial words and the complexity of some extremal problems for sets of prohibited words
• Crucial Words for Abelian Powers
• scientific article; zbMATH DE number 3162927 (Why is no real title available?)

Cited in

(8)

• Improved bounds on the length of maximal abelian square-free words
• Fast algorithms for abelian periods in words and greatest common divisor queries
• Crucial Words for Abelian Powers
• Abelian primitive words
• Identifying all abelian periods of a string in quadratic time and relevant problems
• Crucial abelian k-power-free words
• Bicrucial k-power-free permutations
• A powerful abelian square-free substitution over 4 letters

This page was built for publication: On shortest crucial words avoiding abelian powers

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