| Issue |
RAIRO-Theor. Inf. Appl.
Volume 44, Number 2, April-June 2010
|
|
|---|---|---|
| Page(s) | 257 - 279 | |
| DOI | https://doi.org/10.1051/ita/2010014 | |
| Published online | 26 January 2010 | |
On the syntactic complexity of tree series
1
Aristotle University of Thessaloniki, Department of Mathematics, 54124 Thessaloniki, Greece; bozapali@math.auth.gr
2
Democritus University of Thrace, Department of Production Engineering and Management, 67100 Xanti, Greece; akalamp@math.auth.gr
3
Technical Institute of Kavala, Department of Exact Sciences, 65404 Kavala, Greece.
Received:
17
March
2009
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.