Synchronous forest substitution grammars

The expressive power of synchronous forest (tree-sequence) substitution grammars (SFSGs) is studied in relation to multi bottom-up tree transducers (MBOTs). It is proved that SFSGs have exactly the same expressive power as compositions of an inverse MBOT with an MBOT. This result is used to derive c...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Maletti Andreas
Dokumentumtípus: Cikk
Megjelent: 2017
Sorozat:Acta cybernetica 23 No. 1
Kulcsszavak:Matematikai nyelvészet - számítógépes nyelvészet
Tárgyszavak:
doi:10.14232/actacyb.23.1.2017.15

Online Access:http://acta.bibl.u-szeged.hu/50073
Leíró adatok
Tartalmi kivonat:The expressive power of synchronous forest (tree-sequence) substitution grammars (SFSGs) is studied in relation to multi bottom-up tree transducers (MBOTs). It is proved that SFSGs have exactly the same expressive power as compositions of an inverse MBOT with an MBOT. This result is used to derive complexity results for SFSGs and the fact that compositions of an MBOT with an inverse MBOT can compute tree translations that cannot be computed by any SFSG, although the class of tree translations computable by MBOTs is closed under composition.
Terjedelem/Fizikai jellemzők:269-281
ISSN:0324-721X