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

Bibliographic Details

Published in:	Proceedings 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
Language:	English
Published:	New York, NY, USA ACM 05.07.2016
Series:	ACM 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
ISBN:	9781450343916, 1450343910
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!