Weighted languages recognizable by weighted tree automata

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

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Fülöp Zoltán
Gazdag Zsolt
Dokumentumtípus: Cikk
Megjelent: 2018
Sorozat:Acta cybernetica 23 No. 3
Kulcsszavak:Automaták elmélete, Programozási nyelv
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/55682
LEADER 01466nab a2200229 i 4500
001 acta55682
005 20220621081631.0
008 181108s2018 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Fülöp Zoltán 
245 1 0 |a Weighted languages recognizable by weighted tree automata  |h [elektronikus dokumentum] /  |c  Fülöp Zoltán 
260 |c 2018 
300 |a 867-886 
490 0 |a Acta cybernetica  |v 23 No. 3 
520 3 |a 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. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Automaták elmélete, Programozási nyelv 
700 0 1 |a Gazdag Zsolt  |e aut 
856 4 0 |u http://acta.bibl.u-szeged.hu/55682/1/actacyb_23_3_2018_09.pdf  |z Dokumentum-elérés