Tree algebra of sofic tree languages

Nathalie Aubrun (1) , Marie-Pierre Béal (2)

1 MC2 - Modèles de calcul, Complexité, Combinatoire
2 LIGM - Laboratoire d'Informatique Gaspard-Monge

We consider the languages of finite trees called tree-shift languages which are factorial extensible tree languages. These languages are sets of factors of sub-shifts of infinite trees. We give effective syntactic characterizations of two classes of regular tree-shift languages: the finite type tree languages and the tree languages which are almost of finite type. Each class corresponds to a class of subshifts of trees which is invariant by conjugacy. For this goal, we define a tree algebra which is finer than the classical syntactic tree algebra based on contexts. This allows us to capture the notion of constant tree which is essential in the framework of tree-shift languages.

Domaines: Informatique et langage [cs.CL]

Nathalie Aubrun, Marie-Pierre Béal. Tree algebra of sofic tree languages. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2014, 48 (4), pp.431-451. ⟨hal-01789916⟩