Add to ORKGWe show the diagonal problem for higher-order pushdown au-tomata (HOPDA), and hence the simultaneous unboundedness problem, is decidable. From recent work by Zetzsche this means that we can construct the downward closure of the set of words accepted by a given HOPDA. This also means we can construct the downward closure of the Parikh image of a HOPDA. Both of these consequences play an important rôle in verifying concurrent higher-order programs expressed as HOPDA or safe higher-order recursion schemes
Well-structured pushdown systems (WSPDSs) extend pushdown systems with well-quasi-ordered (possibly ...
The downward closure of a language is the set of all (not necessarily contiguous) subwords of its me...
The downward closure of a language L of words is the set of all (not necessarily contiguous) subword...
We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous ...
We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous ...
Higher-Order Pushdown Automata (HOPDA) are abstract machines equipped with a nested stacks of stacks...
International audienceKarp and Miller's algorithm is a well-known decision procedure that solves the...
In this work we prove decidability of the model-checking problem for saferecursion schemes against p...
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order sta...
We show that collapsible deterministic second level pushdown automata can recognize more languages t...
We show that bisimulation equivalence of order-two pushdown automata is undecidable. Moreover, we st...
We propose a new approach to analysing higher-order recursive schemes. Many results in the literatur...
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every...
We propose a new extension of higher-order pushdown automata, which allows to use an infinite alphab...
Higher-order pushdown systems (PDSs) generalise pushdown systems through theuse of higher-order stac...
Well-structured pushdown systems (WSPDSs) extend pushdown systems with well-quasi-ordered (possibly ...
The downward closure of a language is the set of all (not necessarily contiguous) subwords of its me...
The downward closure of a language L of words is the set of all (not necessarily contiguous) subword...
We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous ...
We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous ...
Higher-Order Pushdown Automata (HOPDA) are abstract machines equipped with a nested stacks of stacks...
International audienceKarp and Miller's algorithm is a well-known decision procedure that solves the...
In this work we prove decidability of the model-checking problem for saferecursion schemes against p...
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order sta...
We show that collapsible deterministic second level pushdown automata can recognize more languages t...
We show that bisimulation equivalence of order-two pushdown automata is undecidable. Moreover, we st...
We propose a new approach to analysing higher-order recursive schemes. Many results in the literatur...
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every...
We propose a new extension of higher-order pushdown automata, which allows to use an infinite alphab...
Higher-order pushdown systems (PDSs) generalise pushdown systems through theuse of higher-order stac...
Well-structured pushdown systems (WSPDSs) extend pushdown systems with well-quasi-ordered (possibly ...
The downward closure of a language is the set of all (not necessarily contiguous) subwords of its me...
The downward closure of a language L of words is the set of all (not necessarily contiguous) subword...