Pages that link to "Item:Q4012668"
From MaRDI portal
The following pages link to Repetitions in the Fibonacci infinite word (Q4012668):
Displaying 50 items.
- Abelian powers and repetitions in Sturmian words (Q287434) (← links)
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- Fibonacci word patterns in two-way infinite Fibonacci words (Q441849) (← links)
- On the fixed points of the iterated pseudopalindromic closure operator (Q544882) (← links)
- Relation between powers of factors and the recurrence function characterizing Sturmian words (Q837150) (← links)
- The structure of subword graphs and suffix trees of Fibonacci words (Q860864) (← links)
- On critical exponents in fixed points of non-erasing morphisms (Q880175) (← links)
- Every real number greater than 1 is a critical exponent (Q995572) (← links)
- Repetitions in beta-integers (Q1013635) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Binary words with a given Diophantine exponent (Q1034641) (← links)
- Periodicity and the golden ratio (Q1275466) (← links)
- The exact number of squares in Fibonacci words (Q1292484) (← links)
- On repetition-free binary words of minimal density (Q1292490) (← links)
- The index of Sturmian sequences (Q1348765) (← links)
- Fibonacci numbers and words (Q1367039) (← links)
- \(\alpha\)-words and factors of characteristic sequences (Q1377868) (← links)
- Some properties of the factors of Sturmian sequences. (Q1401408) (← links)
- Sturmian words and words with a critical exponent (Q1575554) (← links)
- Episturmian words and episturmian morphisms (Q1605314) (← links)
- The maximal number of cubic runs in a word (Q1757839) (← links)
- On powers of words occurring in binary codings of rotations (Q1775724) (← links)
- Locally periodic versus globally periodic infinite words (Q1865395) (← links)
- Powers in Sturmian sequences (Q1873773) (← links)
- Words strongly avoiding fractional powers (Q1970068) (← links)
- Lie complexity of words (Q2163386) (← links)
- Automatic complexity of Fibonacci and tribonacci words (Q2217496) (← links)
- Dejean's conjecture holds for \(n\geq 30\) (Q2271427) (← links)
- Rich square-free words (Q2357378) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- Reversals and palindromes in continued fractions (Q2373747) (← links)
- The numbers of repeated palindromes in the Fibonacci and Tribonacci words (Q2399293) (← links)
- Critical exponents of infinite balanced words (Q2422043) (← links)
- A generalization of the Fibonacci word fractal and the Fibonacci snowflake (Q2437854) (← links)
- Searching for Zimin patterns (Q2512657) (← links)
- Inequalities characterizing standard Sturmian and episturmian words (Q2566013) (← links)
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof (Q2575750) (← links)
- Avoiding letter patterns in ternary square-free words (Q2635082) (← links)
- Prefixes of the Fibonacci word that end with a cube (Q2681077) (← links)
- The Fibonacci automorphism of free Burnside groups (Q3095040) (← links)
- A proof of Dejean’s conjecture (Q3168740) (← links)
- Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
- On $k$-abelian equivalence and generalized Lagrange spectra (Q3298856) (← links)
- Complementary symmetric Rote sequences: the critical exponent and the recurrence function (Q3386617) (← links)
- Words with the Maximum Number of Abelian Squares (Q3449363) (← links)
- On extremal properties of the Fibonacci word (Q3537492) (← links)
- A hierarchy for circular codes (Q3537493) (← links)
- On Critical exponents in fixed points of<i>k</i>-uniform binary morphisms (Q3549288) (← links)
- ON THE REPETITIVITY INDEX OF INFINITE WORDS (Q3636020) (← links)
- Dejean's conjecture holds for N ≥ 27 (Q3653095) (← links)
