2 papers
cs.FL2021
Forest languages defined by counting maximal paths
Martin Beaudry
A leaf path language is a Boolean combination of sets of the form , with and a regular word language, which consist of those forests where the nod…
cs.FL2018
Proving that a Tree Language is not First-Order Definable
Martin Beaudry
We explore from an algebraic viewpoint the properties of the tree languages definable with a first-order formula involving the ancestor predicate, using the description of these la…