2015/05/11 by Srečko Brlek, Nadia Lafrenière, Brlek, Srečko +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #05C05 (Secondary) #68R15 (Primary) #Chemical Synthesis and Analysis #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Mathematics #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1505.02695
openalex publication_date 2015/05/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider finite trees with edges labeled by letters on a finite alphabet \varSigma. Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid \varSigma^*. 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.