On nonrepetitive sequences

DOI10.1016/0097-3165(74)90041-7zbMath0279.05001MaRDI QIDQ1394229

D. E. Jackson, J. A. Schatz, Roger Entringer

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(74)90041-7

Mathematics Subject Classification ID

05A05: Permutations, words, matrices

11B39: Fibonacci and Lucas numbers and polynomials and generalizations

Related Items

Avoiding or Limiting Regularities in Words, Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$, The simplest binary word with only three squares, Abelian squares are avoidable on 4 letters, Avoidability of long 𝑘-abelian repetitions, Infinite words containing the minimal number of repetitions, On some generalizations of abelian power avoidability, Relations on words, Spiraling and folding: the word view, Avoiding large squares in partial words, Avoiding large squares in infinite binary words, Cyclically repetition-free words on small alphabets, A powerful abelian square-free substitution over 4 letters, Pattern avoidance on graphs, Binary words with a given Diophantine exponent, Infinite 0-1 sequences without long adjacent identical blocks, Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem, Every binary pattern of length six is avoidable on the two-letter alphabet, On repetitions of blocks in binary sequences, How many squares can a string contain?, Hierarchie et fermeture de certaines classes de tag-systèmes, Non-repetitive colorings of infinite sets, On the structure and extendibility of \(k\)-power free words, Non-repetitive words: Ages and essences, Say no to case analysis: automating the drudgery of case-based proofs, New bounds on antipowers in words, Avoiding 2-binomial squares and cubes, Chains and fixing blocks in irreducible binary sequences, Hairpin structures defined by DNA trajectories, Infinite binary words containing repetitions of odd period, Words avoiding repetitions in arithmetic progressions, A generalization of repetition threshold, AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY, SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS, On extremal properties of the Fibonacci word, AVOIDING APPROXIMATE SQUARES

Cites Work

• Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
• Unnamed Item
• Unnamed Item
• Unnamed Item