| Informatikai Tanszékcsoport>>> Oktatás>>> | In English |
Finitely Presentable Tree Series
Symeon Bozapalidis - Olympia Louskou-Bozapalidou
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.
Footnotes
... Bozapalidis Department of Mathematics, Aristotle University of Thessaloniki, GR-54006, Thessaloniki, Greece.
... Louskou-Bozapalidou Technical Institute of Western Macedonia, Kozani, Greece.