Pages that link to "Item:Q394756"
From MaRDI portal
The following pages link to On palindromic factorization of words (Q394756):
Displaying 21 items.
- A characterization of subshifts with bounded powers (Q394287) (← links)
- A subquadratic algorithm for minimum palindromic factorization (Q405573) (← links)
- A metric characterisation of repulsive tilings (Q745672) (← links)
- On highly palindromic words: the ternary case (Q777417) (← links)
- Words with many palindrome pair factors (Q888638) (← links)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- Sturmian numeration systems and decompositions to palindromes (Q1750221) (← links)
- Longest arithmetic progressions of palindromes (Q1998905) (← links)
- Palindromic factorization of rich words (Q2143052) (← links)
- Prefix palindromic length of the Sierpinski word (Q2163982) (← links)
- Palindromic length and reduction of powers (Q2166768) (← links)
- On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
- On prefix palindromic length of automatic words (Q2235743) (← links)
- Local symmetry dynamics in one-dimensional aperiodic lattices: a numerical study (Q2346793) (← links)
- Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes (Q2354723) (← links)
- Fully bordered words (Q2358697) (← links)
- Palindromic decompositions with gaps and errors (Q2399364) (← links)
- Palindromic length of words and morphisms in class \(\mathcal{P}\) (Q2420618) (← links)
- Subword Complexity and Decomposition of the Set of Factors (Q2922010) (← links)
- Remarks on Privileged Words (Q3186046) (← links)
- (Q5089256) (← links)
