A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata
2011
Symposium on Theoretical Aspects of Computer Science
Preserved Fulltext
We show that collapsible deterministic second level pushdown automata can recognize more languages than deterministic second level pushdown automata (without collapse). This implies that there exists a tree generated by a second level recursion scheme which is not generated by any second level safe recursion scheme.
doi:10.4230/lipics.stacs.2011.603
dblp:conf/stacs/Parys11
fatcat:lxhax36c4jgixovyk6pp7vukae