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

Celý popis

Podrobná bibliografia

Vydané v:	2012 27th Annual IEEE Symposium on Logic in Computer Science s. 165 - 174
Hlavní autori:	Carayol, A., Serre, O.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.01.2012
Predmet:	Automata Collapsible Pushdown Automata Games MSO Effective Selection Production Recursion Schemes Safety Safety Constraint Semantics Syntactics
ISBN:	1467322636, 9781467322638
ISSN:	1043-6871
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!