| Issue |
RAIRO-Theor. Inf. Appl.
Volume 48, Number 4, October-December 2014
Special issue in the honor of the 14th "Journées Montoises d'Informatique Théorique". II.
|
|
|---|---|---|
| Page(s) | 431 - 451 | |
| DOI | https://doi.org/10.1051/ita/2014018 | |
| Published online | 11 August 2014 | |
Tree algebra of sofic tree languages∗
1 LIP, UMR 5668, ENS de Lyon, CNRS, France.
nathalie.aubrun@ens-lyon.fr
2 Université Paris-Est, Laboratoire d’informatique Gaspard-Monge, UMR 8049 CNRS, France.
beal@univ-mlv.fr
Received: 14 March 2014
Accepted: 17 March 2014
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.
Mathematics Subject Classification: 68501 / 37B10
Key words: Symbolic dynamics / tree-shift / tree automata / tree algebra
© EDP Sciences 2014
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.