Pages that link to "Item:Q2957490"
From MaRDI portal
The following pages link to Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width (Q2957490):
Displayed 13 items.
- Budget-bounded model-checking pushdown systems (Q479843) (← links)
- Visibly pushdown modular games (Q515657) (← links)
- On the path-width of integer linear programming (Q515665) (← links)
- Realizability of concurrent recursive programs (Q1620953) (← links)
- Reachability of scope-bounded multistack pushdown systems (Q2216111) (← links)
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata (Q2817371) (← links)
- On Distributed Monitoring and Synthesis (Q3195680) (← links)
- Automated Synthesis of Distributed Controllers (Q3449462) (← links)
- Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete (Q4639894) (← links)
- Revisiting Underapproximate Reachability for Multipushdown Systems (Q5039520) (← links)
- Data Multi-Pushdown Automata (Q5111652) (← links)
- Towards compositional graph theory (Q5971395) (← links)
