Collapsible pushdown automata and recursion schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addition to the higher-order stack operations pushi and popi, CPDA have an important operation called collapse, whose effect...
Main Authors: | Hague, M, Murawski, A, Ong, C, Serre, O, Soc, I |
---|---|
Format: | Conference item |
Published: |
2008
|
Similar Items
-
Collapsible pushdown automata and recursion schemes
by: Hague, M, et al.
Published: (2017) -
Collapsible Pushdown Automata and Recursion Schemes
by: Murawski, C, et al.
Published: (2008) -
Reachability in pushdown register automata
by: Murawski, A, et al.
Published: (2017) -
On collapsible pushdown automata, their graphs and the power of links
by: Broadbent, C, et al.
Published: (2011) -
A Fragment of ML Decidable by Visibly Pushdown Automata
by: Hopkins, D, et al.
Published: (2011)