同步森林替换语法

IF 0.3 Q4 COMPUTER SCIENCE, CYBERNETICS

Acta Cybernetica Pub Date : 2013-09-03 DOI:10.14232/actacyb.23.1.2017.15

A. Maletti

{"title":"同步森林替换语法","authors":"A. Maletti","doi":"10.14232/actacyb.23.1.2017.15","DOIUrl":null,"url":null,"abstract":"The expressive power of synchronous forest (tree-sequence) substitution grammars (SFSG) is studied in relation to multi bottom-up tree transducers (MBOT). It is proved that SFSG have exactly the same expressive power as compositions of an inverse MBOT with an MBOT. This result is used to derive complexity results for SFSG 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 MBOT is closed under composition.","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":"10 1","pages":"235-246"},"PeriodicalIF":0.3000,"publicationDate":"2013-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Synchronous Forest Substitution Grammars\",\"authors\":\"A. Maletti\",\"doi\":\"10.14232/actacyb.23.1.2017.15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The expressive power of synchronous forest (tree-sequence) substitution grammars (SFSG) is studied in relation to multi bottom-up tree transducers (MBOT). It is proved that SFSG have exactly the same expressive power as compositions of an inverse MBOT with an MBOT. This result is used to derive complexity results for SFSG 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 MBOT is closed under composition.\",\"PeriodicalId\":42512,\"journal\":{\"name\":\"Acta Cybernetica\",\"volume\":\"10 1\",\"pages\":\"235-246\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2013-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Cybernetica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14232/actacyb.23.1.2017.15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Cybernetica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14232/actacyb.23.1.2017.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}

引用次数: 3

摘要

研究了同步森林(树序)替换语法(SFSG)在多自下而上树换能器(MBOT)中的表达能力。结果表明，SFSG与逆MBOT组合物具有完全相同的表达能力。该结果用于推导SFSG的复杂度结果，以及MBOT与逆MBOT的组合可以计算任何SFSG无法计算的树平移，尽管MBOT可计算的树平移类在组合下是封闭的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Synchronous Forest Substitution Grammars

The expressive power of synchronous forest (tree-sequence) substitution grammars (SFSG) is studied in relation to multi bottom-up tree transducers (MBOT). It is proved that SFSG have exactly the same expressive power as compositions of an inverse MBOT with an MBOT. This result is used to derive complexity results for SFSG 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 MBOT is closed under composition.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Acta Cybernetica COMPUTER SCIENCE, CYBERNETICS-

CiteScore

1.10

自引率

0.00%

发文量

期刊介绍： Acta Cybernetica publishes only original papers in the field of Computer Science. Manuscripts must be written in good English.