Pages that link to "Item:Q2720407"
From MaRDI portal
The following pages link to Return words in Sturmian and episturmian words (Q2720407):
Displaying 44 items.
- Palindromic language of thin discrete planes (Q265052) (← links)
- Reversible Christoffel factorizations (Q391135) (← links)
- A new geometric approach to Sturmian words (Q428857) (← links)
- Recent results on syntactic groups of prefix codes. (Q444391) (← links)
- On generating binary words palindromically (Q472173) (← links)
- Morphic images of episturmian words having finite palindromic defect (Q499487) (← links)
- Palindromic complexity of codings of rotations (Q650872) (← links)
- Neutral and tree sets of arbitrary characteristic (Q728278) (← links)
- Occurrences of palindromes in characteristic Sturmian words (Q818112) (← links)
- On a generalization of Christoffel words: epichristoffel words (Q837169) (← links)
- Dejean's conjecture and Sturmian words (Q872047) (← links)
- Zero-measure Cantor spectrum for Schrödinger operators with low-complexity potentials (Q876114) (← links)
- On \(\theta\)-episturmian words (Q1003600) (← links)
- Palindromic richness (Q1003605) (← links)
- Sequences with constant number of return words (Q1022352) (← links)
- Conjugacy and episturmian morphisms. (Q1401317) (← links)
- Hierarchical structures in Sturmian dynamical systems (Q1401381) (← links)
- Episturmian words and episturmian morphisms (Q1605314) (← links)
- Bifix codes and Sturmian words (Q1946105) (← links)
- A characterization of Sturmian sequences by indistinguishable asymptotic pairs (Q2033924) (← links)
- Closed Ziv-Lempel factorization of the \(m\)-bonacci words (Q2136272) (← links)
- Abelian periods of factors of Sturmian words (Q2187128) (← links)
- On non-repetitive complexity of Arnoux-Rauzy words (Q2197452) (← links)
- Some properties of the \(k\)-bonacci words on infinite alphabet (Q2200435) (← links)
- The finite index basis property (Q2259171) (← links)
- Bifix codes and interval exchanges (Q2259187) (← links)
- Acyclic, connected and tree sets (Q2339363) (← links)
- On the number of partitions of an integer in the \(m\)-bonacci base (Q2372776) (← links)
- Powers in a class of \(\mathcal A\)-strict standard episturmian words (Q2373756) (← links)
- Quasiperiodic and Lyndon episturmian words (Q2378539) (← links)
- Characterizations of finite and infinite episturmian words via lexicographic orderings (Q2462316) (← links)
- A characterization of fine words over a finite alphabet (Q2474224) (← links)
- A condition of Boshernitzan and uniform convergence in the multiplicative ergodic theorem (Q2496924) (← links)
- Maximal bifix decoding (Q2514159) (← links)
- Sturmian jungle (or garden?) on multiliteral alphabets (Q2998727) (← links)
- Enumeration Formulæ in Neutral Sets (Q3451104) (← links)
- Some algorithms to compute the conjugates of Episturmian morphisms (Q4462680) (← links)
- Interval exchanges, admissibility and branching Rauzy induction (Q4637855) (← links)
- RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS (Q4786324) (← links)
- Derived sequences of complementary symmetric Rote sequences (Q5108372) (← links)
- COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS (Q5315850) (← links)
- Episturmian words: a survey (Q5321774) (← links)
- Squares and cubes in Sturmian sequences (Q5321780) (← links)
- GAPS IN THE THUE–MORSE WORD (Q5870872) (← links)
