Title of article :
ON THE SYNTACTIC COMPLEXITY OF TREE SERIES
Author/Authors :
Symeon Bozapalidis and Antonios Kalampakas ، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
Abstract :
We display a complexity notion based on the syntax of atree series which yields two distinct hierarchies, one within the class ofrecognizable tree series and another one in the class of non-recognizabletree series
Keywords :
Recognizability , Syntactic complexity , Tree series
Journal title :
RAIRO - Theoretical Informatics and Applications
Journal title :
RAIRO - Theoretical Informatics and Applications
