On the Expressive Power of Higher-Order Pushdown Systems

We show that deterministic collapsible pushdown automata of second order can recognize a language that is not recognizable by any deterministic higher-order pushdown automaton (without collapse) of any order. This implies that there exists a tree generated by a second order collapsible pushdown syst...

Full description

Bibliographic Details
Main Author: Paweł Parys
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2020-08-01
Series:Logical Methods in Computer Science
Subjects:
Online Access:https://lmcs.episciences.org/6692/pdf