Bean, Dwight R.; Ehrenfeucht, Andrzej; McNulty, George F. Avoidable patterns in strings of symbols. (English) Zbl 0428.05001 Pac. J. Math. 85, 261-294 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 12 ReviewsCited in 121 Documents MSC: 05A05 Permutations, words, matrices 05A99 Enumerative combinatorics 20M05 Free semigroups, generators and relations, word problems 68Q45 Formal languages and automata Keywords:finite string of letters; avoidable; finite alphabet; kth power-free; free semigroups; infinite words; n-dimensional arrays; circular words; Burnside problem for semigroups; formal linguistics; partitioned linear orders; linguistics PDF BibTeX XML Cite \textit{D. R. Bean} et al., Pac. J. Math. 85, 261--294 (1979; Zbl 0428.05001) Full Text: DOI