高阶递推格式的对角问题是可判定的

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-05-02 DOI:10.1145/2933575.2934527

Lorenzo Clemente, P. Parys, Sylvain Salvati, I. Walukiewicz

{"title":"高阶递推格式的对角问题是可判定的","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":"{\"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}","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

摘要

一种非确定性递归模式可以识别五元树的语言。这个非常有表现力的模型可以模拟具有崩溃的高阶下推自动机。我们证明了方案对角问题的可决性。这个结果有几个有趣的结果。特别地，给出了一种计算方案识别的词的语言向下闭包的算法。反过来，这对并发系统的可分离性问题和可达性分析具有直接的应用。范畴和主题描述符500[计算理论]:语法和上下文无关的语言;500[计算理论]:树语言;[计算理论]:规则语言

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

查看原文本刊更多论文

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable*

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

求助全文

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

来源期刊

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

自引率

0.00%

发文量