Avoidable patterns on two letters

DOI10.1016/0304-3975(89)90064-9zbMath0662.68078OpenAlexW2039659422MaRDI QIDQ1114419

Ursula Schmidt

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90064-9

zbMATH Keywords

combinatorics on wordsinfinite Fibonacci wordavoidable patternsalphabet with two lettersinfinite Thue-Morse wordoverlapping factor

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Enumerative combinatorics (05A99)

Related Items

On the aperiodic avoidability of binary patterns with variables and reversals ⋮ Growth problems for avoidable words ⋮ Every binary pattern of length six is avoidable on the two-letter alphabet ⋮ Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols ⋮ Grasshopper avoidance of patterns ⋮ Avoidable binary patterns in partial words ⋮ Unavoidable binary patterns

Cites Work

• Avoidable patterns in strings of symbols
• An O(n log n) algorithm for finding all repetitions in a string
• BLOCKING SETS OF TERMS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item