{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
