Pages that link to "Item:Q1835915"
From MaRDI portal
The following pages link to On cube-free \(\omega\)-words generated by binary morphisms (Q1835915):
Displayed 45 items.
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- Fixed points avoiding abelian \(k\)-powers (Q412180) (← links)
- A canonical automaton for one-rule length-preserving string rewrite systems (Q498407) (← links)
- On the conjugacy class of the Fibonacci dynamical system (Q512652) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- On k-repetition freeness of length uniform morphisms over a binary alphabet (Q799123) (← links)
- On regularity of languages generated by copying systems (Q800098) (← 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)
- There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) (Q967293) (← links)
- Sequences generated by infinitely iterated morphisms (Q1070044) (← links)
- Repetition-free words (Q1078338) (← links)
- Permutation properties and the Fibonacci semigroup (Q1114022) (← links)
- A characterization of overlap-free morphisms (Q1308744) (← links)
- On a combinatorial property of Fibonacci semigroup (Q1313868) (← links)
- Infinite self-similar words (Q1356417) (← links)
- Fibonacci numbers and words (Q1367039) (← links)
- Automaticity. II: Descriptional complexity in the unary case (Q1390867) (← links)
- Sturmian words and words with a critical exponent (Q1575554) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- Some results on \(k\)-power-free morphisms (Q1605332) (← links)
- On the structure and extendibility of \(k\)-power free words (Q1891362) (← links)
- Non-repetitive words: Ages and essences (Q1912750) (← links)
- Automatic complexity of Fibonacci and tribonacci words (Q2217496) (← links)
- Periodicity, repetitions, and orbits of an automatic sequence (Q2271417) (← links)
- Growth and order of automorphisms of free groups and free Burnside groups (Q2356957) (← links)
- The numbers of repeated palindromes in the Fibonacci and Tribonacci words (Q2399293) (← links)
- The number of valid factorizations of Fibonacci prefixes (Q2419114) (← 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)
- CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS (Q3022000) (← links)
- The Fibonacci automorphism of free Burnside groups (Q3095040) (← links)
- A test-set for<i>k</i>-power-free binary morphisms (Q3149084) (← links)
- Reduction in non-(<i>k</i>+ 1)-power-free morphisms (Q3186671) (← links)
- Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
- A combinatorial theorem on $p$-power-free words and an application to semigroups (Q3479530) (← links)
- A hierarchy for circular codes (Q3537493) (← links)
- Repetitions in the Fibonacci infinite word (Q4012668) (← links)
- If a DOL language is k-power free then it is circular (Q4630287) (← links)
- A uniform cube-free morphism is<i>k</i>-power-free for all integers<i>k</i>≥ 4 (Q4638265) (← links)
- (Q5061526) (← links)
- Properties of infinite words : Recent results (Q5096141) (← links)
- Fractional powers in Sturmian words (Q5941077) (← links)
- Properties of a ternary infinite word (Q6041042) (← links)
- Continuous 2-colorings and topological dynamics (Q6064217) (← links)