部分函数的归属树变换器

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-10 DOI:arxiv-2406.06141

Sebastian Maneth, Martin Vu

{"title":"部分函数的归属树变换器","authors":"Sebastian Maneth, Martin Vu","doi":"arxiv-2406.06141","DOIUrl":null,"url":null,"abstract":"Attributed tree transducers (atts) have been equipped with regular\nlook-around (i.e., a preprocessing via an attributed relabeling) in order to\nobtain a more robust class of translations. Here we give further evidence of\nthis robustness: we show that if the class of translations realized by\nnondeterministic atts with regular look-around is restricted to partial\nfunctions, then we obtain exactly the class of translations realized by\ndeterministic atts with regular look-around.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"13 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Attributed Tree Transducers for Partial Functions\",\"authors\":\"Sebastian Maneth, Martin Vu\",\"doi\":\"arxiv-2406.06141\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Attributed tree transducers (atts) have been equipped with regular\\nlook-around (i.e., a preprocessing via an attributed relabeling) in order to\\nobtain a more robust class of translations. Here we give further evidence of\\nthis robustness: we show that if the class of translations realized by\\nnondeterministic atts with regular look-around is restricted to partial\\nfunctions, then we obtain exactly the class of translations realized by\\ndeterministic atts with regular look-around.\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"13 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Formal Languages and Automata Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2406.06141\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.06141","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

归属树转换器（atts）已经配备了正则环顾（即通过归属重标注进行预处理），以获得一类更稳健的转换。在这里，我们进一步证明了这一稳健性：我们证明，如果将带有正则环顾的非定域性 atts 所实现的译码类别限制为部分函数，那么我们得到的正是带有正则环顾的非定域性 atts 所实现的译码类别。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Attributed Tree Transducers for Partial Functions

Attributed tree transducers (atts) have been equipped with regular look-around (i.e., a preprocessing via an attributed relabeling) in order to obtain a more robust class of translations. Here we give further evidence of this robustness: we show that if the class of translations realized by nondeterministic atts with regular look-around is restricted to partial functions, then we obtain exactly the class of translations realized by deterministic atts with regular look-around.

求助全文

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

来源期刊

arXiv - CS - Formal Languages and Automata Theory

自引率

0.00%

发文量

期刊最新文献

Query Learning of Advice and Nominal Automata Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny Run supports and initial algebra supports of weighted automata Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata $\mathbb{N}$-polyregular functions arise from well-quasi-orderings