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,...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science s. 96 - 105
Hlavní autori: Clemente, Lorenzo, Parys, Paweł, Salvati, Sylvain, Walukiewicz, Igor
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: New York, NY, USA ACM 05.07.2016
Edícia:ACM Conferences
Predmet:
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
ISBN:9781450343916, 1450343910
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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