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...
Elmentve itt :
| Szerzők: | |
|---|---|
| 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 |