Palindromic complexity of trees
Combinatorics
2015-05-12 v1
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.
Cite
@article{arxiv.1505.02695,
title = {Palindromic complexity of trees},
author = {Srečko Brlek and Nadia Lafrenière and Xavier Provençal},
journal= {arXiv preprint arXiv:1505.02695},
year = {2015}
}
Comments
Submitted to the conference DLT2015