Fülöp Zoltán and Gazdag Zsolt: Weighted languages recognizable by weighted tree automata. In: Acta cybernetica, (23) 3. pp. 867-886. (2018)
Preview |
Cikk, tanulmány, mű
actacyb_23_3_2018_09.pdf Download (411kB) | Preview |
Abstract
Yields of recognizable weighted tree languages, yields of local weighted tree languages, and weighted context-free languages are related. It is shown that the following five classes of weighted languages are the same: (i) the class of weighted languages generated by plain weighted context-free grammars, (ii) the class of weighted languages recognized by plain weighted tree automata, (iii) the class of weighted languages recognized by deterministic and plain topdown weighted tree automata, (iv) the class of weighted languages recognized by deterministic and plain bottom-up weighted tree automata, and (v) the class of weighted languages determined by plain weighted local systems.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 2018 |
| Volume: | 23 |
| Number: | 3 |
| ISSN: | 0324-721X |
| Page Range: | pp. 867-886 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/55467/ |
| Uncontrolled Keywords: | Automaták elmélete, Programozási nyelv |
| Additional Information: | Bibliogr.: p. 884-886. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2018. Nov. 08. 08:43 |
| Last Modified: | 2022. Jun. 21. 08:16 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/55682 |
Actions (login required)
 |
View Item |
