Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols

zbMath1398.68421MaRDI QIDQ1753110

George F. McNulty

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p22

zbMATH Keywords

avoidable wordsdoubled wordsglobal avoidability

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Growth problems for avoidable words
• Avoidable patterns on two letters
• Avoidable patterns in strings of symbols
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Every binary pattern of length six is avoidable on the two-letter alphabet
• Unavoidable binary patterns
• Exponential lower bounds for the number of words of uniform length avoiding a pattern
• Doubled patterns are 3-avoidable
• A generator of morphisms for infinite words
• On Graceful Directed Graphs
• Automatic Sequences
• Strict Bounds for Pattern Avoidance
• THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE

This page was built for publication: Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols