Voir la notice de l'article provenant de la source Numdam
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.
@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://geodesic.mathdoc.fr/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://geodesic.mathdoc.fr/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://geodesic.mathdoc.fr/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
Cité par Sources :