Local weighted tree languages
Local weighted tree languages over semirings are introduced. For an arbitrary semiring, a weighted tree language is shown to be recognizable if it appears as the image of a local weighted tree language under a deterministic relabeling.
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2015
|
| Sorozat: | Acta cybernetica
22 No. 2 |
| Kulcsszavak: | Matematikai nyelvészet |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.22.2.2015.10 |
| Online Access: | http://acta.bibl.u-szeged.hu/36103 |
| LEADER | 00958nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta36103 | ||
| 005 | 20220620101719.0 | ||
| 008 | 161017s2015 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 024 | 7 | |a 10.14232/actacyb.22.2.2015.10 |2 doi | |
| 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 Local weighted tree languages |h [elektronikus dokumentum] / |c Fülöp Zoltán |
| 260 | |c 2015 | ||
| 300 | |a 393-402 | ||
| 490 | 0 | |a Acta cybernetica |v 22 No. 2 | |
| 520 | 3 | |a Local weighted tree languages over semirings are introduced. For an arbitrary semiring, a weighted tree language is shown to be recognizable if it appears as the image of a local weighted tree language under a deterministic relabeling. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Matematika | |
| 695 | |a Matematikai nyelvészet | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/36103/1/actacyb_22_2_2015_10.pdf |z Dokumentum-elérés |