Chains and fixing blocks in irreducible binary sequences

DOI10.1016/0012-365X(85)90065-2zbMath0561.05015MaRDI QIDQ2266018

R. P. Soni, Robert O. Shelton

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chainfixing blockirreducible word

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other designs, configurations (05B30)

Related Items

Non-repetitive words: Ages and essences ⋮ A rewriting of Fife's theorem about overlap-free words ⋮ Extremal overlap-free and extremal \(\beta\)-free binary words ⋮ Nondeterministic automatic complexity of overlap-free and almost square-free words ⋮ Infinite words containing squares at every position ⋮ A characterization of overlap-free morphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Avoidable patterns in strings of symbols
• Strongly non-repetitive sequences and progression-free sets
• On repetitions of blocks in binary sequences
• Bounded AFLs
• On nonrepetitive sequences
• Unending chess, symbolic dynamics and a problem in semi-groups
• Aperiodic words on three symbols.
• Aperiodic words on three symbols. II.
• Binary Sequences which Contain no BBb
• Annihilators in Nonrepetitive Semigroups
• A Characterization of the Morse Minimal Set