Collapsible pushdown automata and recursion schemes

Journal article

We consider recursion schemes (not assumed to be homogeneously typed, and hence not necessarily safe) and use them as generators of (possibly infinite) ranked trees. A recursion scheme is essentially a finite typed deterministic term rewriting system that generates, when one applies the rewriting rules ad infinitum, an infinite tree, called its value tree. A fundamental question is to provide an equivalent description of the trees generated by recursion schemes by a class of machines.

In this paper we answer this open question by introducing collapsible pushdown automata (CPDA), which are an extension of deterministic (higher-order) pushdown automata. A CPDA generates a tree as follows. One considers its transition graph, unfolds it and contracts its silent transitions, which leads to an infinite tree which is finally node labelled thanks to a map from the set of control states of the CPDA to a ranked alphabet.

Our contribution is to prove that these two models, higher-order recursion schemes and collapsible pushdown automata, are equi-expressive for generating infinite ranked trees. This is achieved by giving effective transformations in both directions.

Authors: Hague, M; Murawski, A; Ong, C; Serre, O

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Association for Computing Machinery
• Journal: ACM Transactions on Computational Logic
• Volume: 18
• Issue: 3
• Pages: 25
• Publication date: 2017-08-01
• Acceptance date: 2017-07-01
• DOI: 10.1145/3091122
• EISSN: 1557-945X
• ISSN: 1529-3785
• Keywords: higher-order (collapsible) pushdown automata; Higher-order recursion schemes