Lorenzo Clemente, P. Parys, Sylvain Salvati, I. Walukiewicz
{"title":"The Diagonal Problem for Higher-Order Recursion Schemes is Decidable*","authors":"Lorenzo Clemente, P. Parys, Sylvain Salvati, I. Walukiewicz","doi":"10.1145/2933575.2934527","DOIUrl":null,"url":null,"abstract":"A non-deterministic recursion scheme recognizes a language of fi-nite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We show decidability of the diagonal problem for schemes. This result has several interesting consequences. In particular, it gives an algorithm that computes the downward closure of languages of words recognized by schemes. In turn, this has immediate application to separability problems and reachability analysis of concurrent systems.Categories and Subject Descriptors 500 [Theory of computation]: Grammars and context-free languages; 500 [Theory of computation]: Tree languages; 500 [Theory of computation]: Regular languages","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2933575.2934527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29
Abstract
A non-deterministic recursion scheme recognizes a language of fi-nite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We show decidability of the diagonal problem for schemes. This result has several interesting consequences. In particular, it gives an algorithm that computes the downward closure of languages of words recognized by schemes. In turn, this has immediate application to separability problems and reachability analysis of concurrent systems.Categories and Subject Descriptors 500 [Theory of computation]: Grammars and context-free languages; 500 [Theory of computation]: Tree languages; 500 [Theory of computation]: Regular languages
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
