Unavoidable regularities and factor permutations of words

DOI10.1017/S0308210500032650MaRDI QIDQ4857066zbMATH OpenOpenAlexFDO

Authors Willem Louw Fouché

Publication date 30 June 1996

Published in Proceedings of the Royal Society of Edinburgh: Section A Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0308210500032650

zbMATH Keywords

finite alphabetfinite strings of lettersunavoidabilityword

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Recommendations

• Unary patterns under permutations
• scientific article; zbMATH DE number 3980522
• Unavoidable sets of words of uniform length
• Long unavoidable patterns
• UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS

Cites work

• Avoidable patterns in strings of symbols

Cited in

(3)

• Upper bounds for a Ramsey theorem for trees
• The complexity of unavoidable word patterns
• Unavoidable regularities in long words with bounded number of symbol occurrences

This page was built for publication: Unavoidable regularities and factor permutations of words

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