Binary Sequences which Contain no BBb

DOI10.2307/1998321MaRDI QIDQ3914998zbMATH OpenOpenAlexFDO

Authors Earl D. Fife

Publication date 1980

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1998321

zbMATH Keywords

Morse minimal setnonrepetitive sequences

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Cited in

(19)

• Sequences generated by infinitely iterated morphisms
• Repetition-free words
• Enumeration of irreducible binary words
• Overlap-free words and finite automata
• Periodicity and the golden ratio
• A characterization of overlap-free morphisms
• The set of k-power free words over is empty or perfect
• The Thue-Morse word contains circular \(5/2^+\) power free words of every length
• On the structure and extendibility of \(k\)-power free words
• Non-repetitive words: Ages and essences
• Chains and fixing blocks in irreducible binary sequences
• Markov diagrams for some non-Markovian systems
• Deciding context equivalence of binary overlap-free words in linear time
• Infinite words containing squares at every position
• The analog of overlap-freeness for the period-doubling sequence
• A rewriting of Fife's theorem about overlap-free words
• The first-order theory of binary overlap-free words is decidable
• The analogue of overlap-freeness for the Fibonacci morphism
• Low complexity binary words avoiding (5/2)^+-powers

This page was built for publication: Binary Sequences which Contain no BBb

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3914998)