Palindromes in circular words

DOI10.1016/j.tcs.2014.07.012zbMath1307.68062OpenAlexW2049732011MaRDI QIDQ401312

R. Jamie Simpson

Publication date: 26 August 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.07.012

zbMATH Keywords

palindromecircular wordpalindromic factors

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

Lower bounds for the number of repetitions in 2D strings ⋮ Tight bound for the number of distinct palindromes in a tree ⋮ Counting subwords in circular words and their Parikh matrices ⋮ Distinct Squares in Circular Words ⋮ Palindromes in starlike trees

Cites Work

• Equations on palindromes and circular words
• The ``runs conjecture
• Fine and Wilf's theorem for three periods and a generalization of Sturmian words
• Sturmian words: structure, combinatorics, and their arithmetics
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Uniqueness Theorems for Periodic Functions
• Episturmian words and some constructions of de Luca and Rauzy
• Unnamed Item
• Unnamed Item

This page was built for publication: Palindromes in circular words