On the syntactic complexity of tree series
Aristotle University of Thessaloniki, Department of Mathematics, 54124 Thessaloniki, Greece; firstname.lastname@example.org
2 Democritus University of Thrace, Department of Production Engineering and Management, 67100 Xanti, Greece; email@example.com
3 Technical Institute of Kavala, Department of Exact Sciences, 65404 Kavala, Greece.
Accepted: 16 December 2009
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.
Mathematics Subject Classification: 68Q01 / 68Q15
Key words: Tree series / syntactic complexity / recognizability
© EDP Sciences, 2010