no. 2
On the syntactic complexity of tree series
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 44 (2010) no. 2, pp. 257-279.

We display a complexity notion based on the syntax of a tree series which yields two distinct hierarchies, one within the class of recognizable tree series and another one in the class of non-recognizable tree series.

DOI : 10.1051/ita/2010014
Classification : 68Q01, 68Q15
Mots clés : tree series, syntactic complexity, recognizability 
@article{ITA_2010__44_2_257_0,
     author = {Bozapalidis, Symeon and Kalampakas, Antonios},
     title = {On the syntactic complexity of tree series},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {257--279},
     publisher = {EDP-Sciences},
     volume = {44},
     number = {2},
     year = {2010},
     doi = {10.1051/ita/2010014},
     mrnumber = {2674543},
     language = {en},
     url = {http://archive.numdam.org/articles/10.1051/ita/2010014/}
}
TY  - JOUR
AU  - Bozapalidis, Symeon
AU  - Kalampakas, Antonios
TI  - On the syntactic complexity of tree series
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2010
SP  - 257
EP  - 279
VL  - 44
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/articles/10.1051/ita/2010014/
DO  - 10.1051/ita/2010014
LA  - en
ID  - ITA_2010__44_2_257_0
ER  - 
%0 Journal Article
%A Bozapalidis, Symeon
%A Kalampakas, Antonios
%T On the syntactic complexity of tree series
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2010
%P 257-279
%V 44
%N 2
%I EDP-Sciences
%U http://archive.numdam.org/articles/10.1051/ita/2010014/
%R 10.1051/ita/2010014
%G en
%F ITA_2010__44_2_257_0
Bozapalidis, Symeon; Kalampakas, Antonios. On the syntactic complexity of tree series. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 44 (2010) no. 2, pp. 257-279. doi : 10.1051/ita/2010014. http://archive.numdam.org/articles/10.1051/ita/2010014/

[1] J. Berstel and C. Reutenauer, Recognizable formal power series on trees. Theoret. Comput. Sci. 18 (1982) 115-148. | Zbl

[2] S. Bozapalidis, Effective construction of the syntactic algebra of a recognizable series on trees. Acta Informatica 28 (1991) 351-363. | Zbl

[3] S. Bozapalidis and A. Alexandrakis, Représentations Matricielles des Séries d'Arbres Reconnaissables. Theor. Inf. Appl. 23 (1989) 449-459. | Numdam | Zbl

[4] S. Bozapalidis and O.L. Bozapalidou, The rank of a formal tree power series. Theoret. Comput. Sci. 27 (1983) 211-215. | Zbl

[5] S. Bozapalidis and A. Kalampakas, Recognizability of graph and pattern languages. Acta Informatica 42 (2006) 553-581. | Zbl

[6] S. Bozapalidis and A. Kalampakas, On the Complexity of the Syntax of Tree Languages, Proceedings of the 3rd International Conference of Algebraic Informatics, CAI09. Lect. Notes Comput. Sci. 5725 (2009) 189-203.

[7] F. Gécseg and M. Steinby, Tree Automata. Akademiai Kiado, Budapest (1984). | Zbl

[8] A. Kalampakas, The Syntactic Complexity of Eulerian Graphs, Proceedings of the 2nd International Conference of Algebraic Informatics, CAI07. Lect. Notes Comput. Sci. 4728 (2007) 208-217. | Zbl

Cité par Sources :