Finitely presentable tree series

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 constitu...

Full description

Saved in:
Bibliographic Details
Main Authors: Bozapalidis Symeon
Louskou-Bozapalidou Olympia
Format: Article
Published: 2006
Series:Acta cybernetica 17 No. 3
Kulcsszavak:Számítástechnika, Kibernetika
Subjects:
Online Access:http://acta.bibl.u-szeged.hu/12776
Description
Summary: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.
Physical Description:459-470
ISSN:0324-721X