Finitely presentable tree series

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

[thumbnail of cybernetica_017_numb_003_459-470.pdf]
Preview
Cikk, tanulmány, mű
cybernetica_017_numb_003_459-470.pdf

Download (812kB) | Preview

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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2006
Volume: 17
Number: 3
ISSN: 0324-721X
Page Range: pp. 459-470
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38521/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 469-470. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 15. 13:35
URI: http://acta.bibl.u-szeged.hu/id/eprint/12776

Actions (login required)

View Item View Item