Pages that link to "Item:Q5941085"
From MaRDI portal
The following pages link to Episturmian words and some constructions of de Luca and Rauzy (Q5941085):
Displaying 50 items.
- Imbalances in Arnoux-Rauzy sequences (Q1572652) (← links)
- Episturmian words and episturmian morphisms (Q1605314) (← links)
- Balance properties of multi-dimensional words (Q1605336) (← links)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- String powers in trees (Q1679231) (← links)
- Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- Palindrome complexity. (Q1853729) (← links)
- \(m\)-balanced words: A generalization of balanced words (Q1884918) (← links)
- Bifix codes and Sturmian words (Q1946105) (← links)
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287) (← links)
- On closed-rich words (Q2117106) (← links)
- Closed Ziv-Lempel factorization of the \(m\)-bonacci words (Q2136272) (← links)
- Palindromic factorization of rich words (Q2143052) (← links)
- Minimal unique palindromic substrings after single-character substitution (Q2146122) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← links)
- Morphisms generating antipalindromic words (Q2198987) (← links)
- On the Stern-Brocot expansion of real numbers (Q2199515) (← links)
- Some properties of the \(k\)-bonacci words on infinite alphabet (Q2200435) (← links)
- On generalized highly potential words (Q2215978) (← links)
- On sets of indefinitely desubstitutable words (Q2220783) (← links)
- On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
- Palindromic trees for a sliding window and its applications (Q2234804) (← links)
- Characteristic morphisms of generalized episturmian words (Q2271423) (← links)
- A new characteristic property of rich words (Q2271424) (← links)
- Burrows-Wheeler transform and palindromic richness (Q2271441) (← links)
- On abelian saturated infinite words (Q2326392) (← links)
- More properties of the Fibonacci word on an infinite alphabet (Q2330118) (← links)
- Obituary: Aldo de Luca 1941--2018 (Q2334412) (← links)
- Sturmian words and the Stern sequence (Q2345447) (← links)
- Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes (Q2354723) (← links)
- Rich square-free words (Q2357378) (← links)
- Specular sets (Q2358694) (← links)
- Palindromic complexity of infinite words associated with simple Parry numbers (Q2372771) (← links)
- Powers in a class of \(\mathcal A\)-strict standard episturmian words (Q2373756) (← links)
- A connection between palindromic and factor complexity using return words (Q2377963) (← links)
- Quasiperiodic and Lyndon episturmian words (Q2378539) (← links)
- The numbers of repeated palindromes in the Fibonacci and Tribonacci words (Q2399293) (← links)
- Normalization of ternary generalized pseudostandard words (Q2420613) (← links)
- Palindromic length of words and morphisms in class \(\mathcal{P}\) (Q2420618) (← links)
- Open and closed factors in Arnoux-Rauzy words (Q2423399) (← links)
- On highly potential words (Q2444733) (← links)
- Palindromic closures using multiple antimorphisms (Q2446105) (← links)
- A coloring problem for infinite words (Q2451905) (← links)
- Characterizations of finite and infinite episturmian words via lexicographic orderings (Q2462316) (← links)
- A characterization of fine words over a finite alphabet (Q2474224) (← links)
- On different generalizations of episturmian words (Q2481949) (← links)
- A condition of Boshernitzan and uniform convergence in the multiplicative ergodic theorem (Q2496924) (← links)
- Pseudopalindrome closure operators in free monoids (Q2508984) (← links)
- A palindromization map on free monoids (Q2510763) (← links)
