Pages that link to "Item:Q5671382"
From MaRDI portal
The following pages link to Sequences with minimal block growth (Q5671382):
Displaying 50 items.
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution (Q1606161) (← links)
- On low-complexity bi-infinite words and their factors (Q1606164) (← links)
- Transcendence of Sturmian or morphic continued fractions (Q1612522) (← links)
- Tree shift topological entropy (Q1659984) (← links)
- Reversing and extended symmetries of shift spaces (Q1678225) (← links)
- On the additive complexity of a Thue-Morse-like sequence (Q1741501) (← links)
- Plane digitization and related combinatorial problems (Q1775618) (← links)
- Substitution invariant Sturmian bisequences (Q1809048) (← links)
- Infinite words with linear subword complexity (Q1824405) (← links)
- Digital straightness -- a review (Q1827822) (← links)
- Palindrome complexity. (Q1853729) (← links)
- The linking homomorphism of one-dimensional minimal sets (Q1878517) (← links)
- Moments of conjugacy classes of binary words (Q1884975) (← links)
- Sturmian words, \(\beta\)-shifts, and transcendence (Q1885910) (← links)
- Bifix codes and Sturmian words (Q1946105) (← links)
- Palindromes and Sturmian words (Q1960407) (← links)
- A characterization of Sturmian sequences by indistinguishable asymptotic pairs (Q2033924) (← links)
- Markov partitions for toral \(\mathbb{Z}^2\)-rotations featuring Jeandel-Rao Wang shift and model sets (Q2077157) (← links)
- On the 2-abelian complexity of generalized Cantor sequences (Q2087468) (← links)
- Flexibility of the pressure function (Q2090440) (← links)
- On balanced and abelian properties of circular words over a ternary alphabet (Q2098185) (← links)
- Almost everywhere balanced sequences of complexity \(2n + 1\) (Q2107735) (← links)
- Rauzy induction of polygon partitions and toral \(\mathbb{Z}^2\)-rotations (Q2153354) (← links)
- Column representation of Sturmian words in cellular automata (Q2163988) (← links)
- A gap of the exponents of repetitions of Sturmian words (Q2235356) (← links)
- On the boundary sequence of an automatic sequence (Q2237216) (← links)
- Abelian closures of infinite binary words (Q2237936) (← links)
- Remainder approach for the computation of digital straight line subsegment characteristics (Q2255822) (← links)
- Arnoux-Rauzy substitutions and Palindrome words (Q2317957) (← links)
- Studies on finite Sturmian words (Q2354408) (← links)
- On complementary triples of Sturmian bisequences (Q2365505) (← links)
- Quasiperiodic and Lyndon episturmian words (Q2378539) (← links)
- On growth and fluctuation of \(k\)-abelian complexity (Q2400973) (← links)
- On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
- On the abelian complexity of the Rudin-Shapiro sequence (Q2408601) (← links)
- On the abelian complexity of generalized Thue-Morse sequences (Q2420616) (← links)
- Open and closed factors in Arnoux-Rauzy words (Q2423399) (← links)
- Classification of rotations on the torus \(\mathbb T^2\) (Q2456373) (← links)
- On an involution of Christoffel words and Sturmian morphisms (Q2472847) (← links)
- Maximal bifix decoding (Q2514159) (← links)
- Structure of three-interval exchange transformations. III: Ergodic and spectral properties (Q2565902) (← links)
- Smooth words over arbitrary alphabets (Q2566015) (← links)
- Maximal pattern complexity of words over \(\ell\) letters (Q2581466) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences (Q2635089) (← links)
- Sturmian sequences and the lexicographic world (Q2701640) (← links)
- PERMUTATION COMPLEXITY AND THE LETTER DOUBLING MAP (Q2841975) (← links)
- Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion (Q2908171) (← links)
- Three complexity functions (Q2911427) (← links)
- Morphisms preserving the set of words coding three interval exchange (Q2911430) (← links)
