Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-27T08:04:07.833Z Has data issue: false hasContentIssue false
  • English
  • Français

On the syntactic complexity of tree series

Published online by Cambridge University Press:  26 January 2010

Symeon Bozapalidis  and
Antonios Kalampakas
Symeon Bozapalidis
Affiliation:
Aristotle University of Thessaloniki, Department of Mathematics, 54124 Thessaloniki, Greece; [email protected]
Antonios Kalampakas
Affiliation:
Democritus University of Thrace, Department of Production Engineering and Management, 67100 Xanti, Greece; [email protected] Technical Institute of Kavala, Department of Exact Sciences, 65404 Kavala, Greece.
Get access

Abstract

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.

Keywords

Tree seriessyntactic complexityrecognizability
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 44 , Issue 2 , April 2010 , pp. 257 - 279
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.)

References

Berstel, J. and Reutenauer, C., Recognizable formal power series on trees. Theoret. Comput. Sci. 18 (1982) 115–148. CrossRef
Bozapalidis, S., Effective construction of the syntactic algebra of a recognizable series on trees. Acta Informatica 28 (1991) 351–363. CrossRef
Bozapalidis, S. and Alexandrakis, A., Représentations Matricielles des Séries d'Arbres Reconnaissables. Theor. Inf. Appl. 23 (1989) 449–459. CrossRef
Bozapalidis, S. and Bozapalidou, O.L., The rank of a formal tree power series. Theoret. Comput. Sci. 27 (1983) 211–215. CrossRef
Bozapalidis, S. and Kalampakas, A., Recognizability of graph and pattern languages. Acta Informatica 42 (2006) 553–581. CrossRef
Bozapalidis, S. and Kalampakas, A., On the Complexity of the Syntax of Tree Languages, Proceedings of the 3rd International Conference of Algebraic Informatics, CAI09. Lect. Notes Comput. Sci. 5725 (2009) 189–203. CrossRef
F. Gécseg and M. Steinby, Tree Automata. Akademiai Kiado, Budapest (1984).
Kalampakas, A., The Syntactic Complexity of Eulerian Graphs, Proceedings of the 2nd International Conference of Algebraic Informatics, CAI07. Lect. Notes Comput. Sci. 4728 (2007) 208–217. CrossRef