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