Classes of tree languages and DR tree languages given by classes of semigroups

Gécseg, Ferenc: Classes of tree languages and DR tree languages given by classes of semigroups. Acta cybernetica, (20) 2. pp. 252-267. (2011)

[img] Cikk, tanulmány, mű
actacyb_20_2_2011_3.pdf

Download (164kB)

Abstract

In the first section of the paper we give general conditions under which a class of recognizable tree languages with a given property can be defined by a class of monoids or semigroups defining the class of string languages having the same property. In the second part similar questions are studied for classes of (DR) tree languages recognized by deterministic root-to-frontier tree recognizers.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2011
Volume: 20
Number: 2
Page Range: pp. 252-267
ISSN: 0324-721X
Language: angol
Heading title: Regular papers
DOI: https://doi.org/10.14232/actacyb.20.2.2011.3
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: 267. p.; Abstract
Date Deposited: 2016. Oct. 15. 12:24
Last Modified: 2018. Jun. 05. 14:19
URI: http://acta.bibl.u-szeged.hu/id/eprint/12910

Actions (login required)

View Item View Item