The Diagonal Problem for Higher-Order Recursion Schemes is Decidable

A non-deterministic recursion scheme recognizes a language of finite 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,...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science pp. 96 - 105
Main Authors Clemente, Lorenzo, Parys, Paweł, Salvati, Sylvain, Walukiewicz, Igor
Format Conference Proceeding
LanguageEnglish
Published New York, NY, USA ACM 05.07.2016
SeriesACM Conferences
Subjects
Theory of computation
Theory of computation > Formal languages and automata theory
separability problem
downward closure
higher-order recursion schemes
higher-order OI grammars
diagonal problem
Online AccessGet full text
ISBN9781450343916
1450343910
DOI10.1145/2933575.2934527

Cover

More Information
Summary:A non-deterministic recursion scheme recognizes a language of finite 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.
ISBN:9781450343916
1450343910
DOI:10.1145/2933575.2934527