Voir la notice de l'article provenant de la source Numdam
We consider the languages of finite trees called tree-shift languages which are factorial extensible tree languages. These languages are sets of factors of subshifts 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.
@article{ITA_2014__48_4_431_0, author = {Aubrun, Nathalie and B\'eal, Marie-Pierre}, title = {Tree algebra of sofic tree languages}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {431--451}, publisher = {EDP-Sciences}, volume = {48}, number = {4}, year = {2014}, doi = {10.1051/ita/2014018}, mrnumber = {3302496}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.1051/ita/2014018/} }
TY - JOUR AU - Aubrun, Nathalie AU - Béal, Marie-Pierre TI - Tree algebra of sofic tree languages JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2014 SP - 431 EP - 451 VL - 48 IS - 4 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ita/2014018/ DO - 10.1051/ita/2014018 LA - en ID - ITA_2014__48_4_431_0 ER -
%0 Journal Article %A Aubrun, Nathalie %A Béal, Marie-Pierre %T Tree algebra of sofic tree languages %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2014 %P 431-451 %V 48 %N 4 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ita/2014018/ %R 10.1051/ita/2014018 %G en %F ITA_2014__48_4_431_0
Aubrun, Nathalie; Béal, Marie-Pierre. Tree algebra of sofic tree languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 48 (2014) no. 4, pp. 431-451. doi: 10.1051/ita/2014018
Cité par Sources :