Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-17T22:26:38.725Z Has data issue: false hasContentIssue false

On the syntactic complexity of tree series

Published online by Cambridge University Press:  26 January 2010

Symeon Bozapalidis
Affiliation:
Aristotle University of Thessaloniki, Department of Mathematics, 54124 Thessaloniki, Greece; bozapali@math.auth.gr
Antonios Kalampakas
Affiliation:
Democritus University of Thrace, Department of Production Engineering and Management, 67100 Xanti, Greece; akalamp@math.auth.grTechnical Institute of Kavala, Department of Exact Sciences, 65404 Kavala, Greece.
Get access

Abstract

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

Information

Type
Research Article
Copyright
© EDP Sciences, 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable