Long unavoidable patterns

DOI10.1007/BF00292112zbMath0642.68138MaRDI QIDQ1101241

Ursula Schmidt

Publication date: 1987

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

combinatorial properties of wordsquasi-powersubword occurrenceunavoidable patternsunavoidable word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Source coding (94A29)

Related Items (1)

Every binary pattern of length six is avoidable on the two-letter alphabet

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
• On a Special Class of Recurrent Events

This page was built for publication: Long unavoidable patterns