Palindromic Complexity of Trees

DOI10.1007/978-3-319-21500-6_12zbMath1434.68380arXiv1505.02695MaRDI QIDQ3451098

Nadia Lafrenière, Srečko Brlek, Xavier Provençal

Publication date: 10 November 2015

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.02695

zbMATH Keywords

words; Sidon sets; language; trees; palindromic complexity

Mathematics Subject Classification ID

68R15: Combinatorics on words

68Q45: Formal languages and automata

Related Items

Palindromes in starlike trees, Tight bound for the number of distinct palindromes in a tree, String powers in trees, String covers of a tree

Cites Work

• Unnamed Item
• Unnamed Item
• Palindromic language of thin discrete planes
• Complexity and palindromic defect of infinite words
• How many squares can a string contain?
• Sturmian words: structure, combinatorics, and their arithmetics
• Tilings and rotations on the torus: A two-dimensional generalization of Sturmian sequences
• Palindrome complexity.
• Singular continuous spectrum for palindromic Schrödinger operators
• Proof of the Brlek-Reutenauer conjecture
• A \(d\)-dimensional extension of Christoffel words
• The Maximum Number of Squares in a Tree
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Episturmian words: a survey
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems
• Episturmian words and some constructions of de Luca and Rauzy