Abstract
We consider finite trees with edges labeled by letters on a finite alphabet Σ. Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid Σ∗. The set of all such words defines the language of the tree. In this paper, we investigate the palindromic complexity of trees and provide hints for an upper bound on the number of distinct palindromes in the language of a tree.
Author supplied keywords
Cite
CITATION STYLE
Brlek, S., Lafrenière, N., & Provençal, X. (2015). Palindromic complexity of trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9168, pp. 155–166). Springer Verlag. https://doi.org/10.1007/978-3-319-21500-6_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
