Finitely presentable tree series

Bozapalidis, Symeon and Louskou-Bozapalidou, Olympia: Finitely presentable tree series. Acta cybernetica, (17) 3. pp. 459-470. (2006)

Cikk, tanulmány, mű cybernetica_017_numb_003_459-470.pdf Download (812kB)

Abstract

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.

Actions (login required)

View Item