用宏树换能器描述属性树翻译

Theor. Comput. Sci. Pub Date : 2022-09-15 DOI:10.48550/arXiv.2209.07090

Kenji Hashimoto, S. Maneth

{"title":"用宏树换能器描述属性树翻译","authors":"Kenji Hashimoto, S. Maneth","doi":"10.48550/arXiv.2209.07090","DOIUrl":null,"url":null,"abstract":"It is well known that attributed tree transducers can be equipped with\"regular look-around\"in order to obtain a more robust class of translations. We present two characterizations of this class in terms of macro tree transducers (MTTs): the first one is a static restriction on the rules of the MTTs, where the MTTs need to be equipped with regular look-around. The second characterization is a dynamic one, where the MTTs only need regular look-ahead.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"38 2 1","pages":"113943"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Characterizing Attributed Tree Translations in Terms of Macro Tree Transducers\",\"authors\":\"Kenji Hashimoto, S. Maneth\",\"doi\":\"10.48550/arXiv.2209.07090\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is well known that attributed tree transducers can be equipped with\\\"regular look-around\\\"in order to obtain a more robust class of translations. We present two characterizations of this class in terms of macro tree transducers (MTTs): the first one is a static restriction on the rules of the MTTs, where the MTTs need to be equipped with regular look-around. The second characterization is a dynamic one, where the MTTs only need regular look-ahead.\",\"PeriodicalId\":23063,\"journal\":{\"name\":\"Theor. Comput. Sci.\",\"volume\":\"38 2 1\",\"pages\":\"113943\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theor. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2209.07090\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theor. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2209.07090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

众所周知，属性树换能器可以配备“常规查找”，以获得更健壮的翻译类。我们在宏树传感器(mtt)方面提出了这类的两个特征:第一个是对mtt规则的静态限制，其中mtt需要配备常规的环顾。第二个特征是动态的，其中mtt只需要定期提前查看。

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

查看原文本刊更多论文

Characterizing Attributed Tree Translations in Terms of Macro Tree Transducers

It is well known that attributed tree transducers can be equipped with"regular look-around"in order to obtain a more robust class of translations. We present two characterizations of this class in terms of macro tree transducers (MTTs): the first one is a static restriction on the rules of the MTTs, where the MTTs need to be equipped with regular look-around. The second characterization is a dynamic one, where the MTTs only need regular look-ahead.

求助全文

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

来源期刊

Theor. Comput. Sci.

自引率

0.00%

发文量