Words with many palindrome pair factors
From MaRDI portal
Publication:888638
zbMath1327.68181arXiv1509.05396MaRDI QIDQ888638
Narad Rampersad, Adam Borchert
Publication date: 2 November 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.05396
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On palindromic factorization of words
- Palindromic prefixes and episturmian words
- Palindromic richness
- On the number of words in the language \(\{w \epsilon \Sigma^* | w=w^ r\}^ 2\)
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Lyndon words and singular factors of sturmian words
- Some combinatorial properties of Sturmian words
- Palindrome complexity.
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
- AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
This page was built for publication: Words with many palindrome pair factors
