The structure of the set of cube-free $ Z$-words in a two-letter alphabet
From MaRDI portal
Publication:2710702
DOI10.1070/IM2000v064n04ABEH000301zbMath0972.68131MaRDI QIDQ2710702
Publication date: 26 April 2001
Published in: Izvestiya: Mathematics (Search for Journal in Brave)
Related Items (13)
ON THE EXISTENCE OF MINIMAL β-POWERS ⋮ Polynomial versus exponential growth in repetition-free binary words ⋮ Automatic sequences in negative bases and proofs of some conjectures of shevelev ⋮ Deciding context equivalence of binary overlap-free words in linear time ⋮ Growth properties of power-free languages ⋮ There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) ⋮ On the fixed points of the iterated pseudopalindromic closure operator ⋮ On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) ⋮ Growth rates of complexity of power-free languages ⋮ Every real number greater than 1 is a critical exponent ⋮ Computing the \(k\)-binomial complexity of the Thue-Morse word ⋮ Binary words with a given Diophantine exponent ⋮ Subword complexity and power avoidance
This page was built for publication: The structure of the set of cube-free $ Z$-words in a two-letter alphabet
