{"title":"One-Pass Reductions","authors":"S. Vágvölgyi","doi":"10.14232/actacyb.22.3.2016.6","DOIUrl":null,"url":null,"abstract":"We study OI and IO one-pass reduction sequences with term rewritesystems. We present second order decidability and undecidabilityresults on recognizable tree languages and one-pass reductions. Forleft-linear TRSs, the second order OI inclusion problem and the secondorder OI reachability problem are decidable, the second order OIjoinability problem is undecidable. For right-linear TRSs, the secondorder common IO ancestor problem is undecidable.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Cybern.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14232/actacyb.22.3.2016.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
We study OI and IO one-pass reduction sequences with term rewritesystems. We present second order decidability and undecidabilityresults on recognizable tree languages and one-pass reductions. Forleft-linear TRSs, the second order OI inclusion problem and the secondorder OI reachability problem are decidable, the second order OIjoinability problem is undecidable. For right-linear TRSs, the secondorder common IO ancestor problem is undecidable.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
