Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection

Higher-order recursion schemes are rewriting systems for simply typed terms and they are known to be equi-expressive with collapsible pushdown automata (CPDA) for generating trees. We argue that CPDA are an essential model when working with recursion schemes. First, we give a new proof of the transl...

Full description

Bibliographic Details

Published in:	2012 27th Annual IEEE Symposium on Logic in Computer Science pp. 165 - 174
Main Authors:	Carayol, A., Serre, O.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.01.2012
Subjects:	Automata Collapsible Pushdown Automata Games MSO Effective Selection Production Recursion Schemes Safety Safety Constraint Semantics Syntactics
ISBN:	1467322636, 9781467322638
ISSN:	1043-6871
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!