Tree algebra of sofic tree languages

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-01789916
Contributor : Marie-Pierre Béal <>
Submitted on : Friday, May 11, 2018 - 3:03:23 PM
Last modification on : Thursday, February 7, 2019 - 5:24:18 PM
Long-term archiving on : Tuesday, September 25, 2018 - 9:59:35 PM

File

AubrunBeal_JM12.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01789916, version 1

Citation

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

Share

Metrics

Record views

62

Files downloads

113