1 paper · 1 filter
Srečko Brlek, Nadia Lafrenière, Xavier Provençal
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 $…