Article contents
On the syntactic complexity of tree series
Published online by Cambridge University Press: 26 January 2010
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.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2010
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
- 2
- Cited by