Finitely presentable tree series

  • Symeon Bozapalidis
  • Olympia Louskou-Bozapalidou


Tree height is known to be a non-recognizable series. In this paper, we detect two remarkable classes where this series belongs: that of polynomially presentable tree series and that of almost linearly presentable tree series. Both the above classes have nice closure properties, and seem to constitute the first levels of a tree series hierarchy which starts from the class of recognizable treeseries.


Download data is not yet available.
How to Cite
Bozapalidis, S., & Louskou-Bozapalidou, O. (2006). Finitely presentable tree series. Acta Cybernetica, 17(3), 459-470. Retrieved from
Regular articles

Most read articles by the same author(s)