Pages that link to "Item:Q2710702"
From MaRDI portal
The following pages link to The structure of the set of cube-free $ Z$-words in a two-letter alphabet (Q2710702):
Displaying 13 items.
- Deciding context equivalence of binary overlap-free words in linear time (Q444679) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- On the fixed points of the iterated pseudopalindromic closure operator (Q544882) (← links)
- Polynomial versus exponential growth in repetition-free binary words (Q598459) (← links)
- There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) (Q967293) (← links)
- Growth rates of complexity of power-free languages (Q986556) (← links)
- Every real number greater than 1 is a critical exponent (Q995572) (← links)
- Binary words with a given Diophantine exponent (Q1034641) (← links)
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) (Q2271420) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- ON THE EXISTENCE OF MINIMAL β-POWERS (Q2909104) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)
- Automatic sequences in negative bases and proofs of some conjectures of shevelev (Q6041046) (← links)