Pages that link to "Item:Q385043"
From MaRDI portal
The following pages link to On the least number of palindromes contained in an infinite word (Q385043):
Displaying 18 items.
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability (Q346252) (← links)
- A subquadratic algorithm for minimum palindromic factorization (Q405573) (← links)
- Sturmian numeration systems and decompositions to palindromes (Q1750221) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- Longest arithmetic progressions of palindromes (Q1998905) (← links)
- On closed-rich words (Q2117106) (← links)
- Say no to case analysis: automating the drudgery of case-based proofs (Q2117657) (← links)
- On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
- On the least number of palindromes in two-dimensional words (Q2286748) (← links)
- On the aperiodic avoidability of binary patterns with variables and reversals (Q2358690) (← links)
- Properties of a class of Toeplitz words (Q2672565) (← links)
- Enumeration of two dimensional palindromes (Q2672656) (← links)
- (Q5061525) (← links)
- Reciprocal Sum of Palindromes (Q5212143) (← links)
- HV-Palindromes in Two-Dimensional Words (Q6114875) (← links)
- Finite and infinite closed-rich words (Q6140350) (← links)
- Rich words in the block reversal of a word (Q6157425) (← links)
- Critical exponent of binary words with few distinct palindromes (Q6574368) (← links)
