Gécseg Ferenc: Classes of tree languages and DR tree languages given by classes of semigroups. In: Acta cybernetica, (20) 2. pp. 252-267. (2011)
Preview |
Cikk, tanulmány, mű
actacyb_20_2_2011_3.pdf Download (164kB) | Preview |
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 |
|---|---|
| Heading title: | Regular papers |
| Journal or Publication Title: | Acta cybernetica |
| Date: | 2011 |
| Volume: | 20 |
| Number: | 2 |
| ISSN: | 0324-721X |
| Page Range: | pp. 252-267 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38532/ |
| DOI: | 10.14232/actacyb.20.2.2011.3 |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: 267. p. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:24 |
| Last Modified: | 2022. Jun. 17. 13:45 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12910 |
Actions (login required)
 |
View Item |
