Pages that link to "Item:Q2828251"
From MaRDI portal
The following pages link to Unboundedness and downward closures of higher-order pushdown automata (Q2828251):
Displaying 13 items.
- General decidability results for asynchronous shared-memory programs: higher-order and beyond (Q2044219) (← links)
- Weighted automata with storage (Q2280328) (← links)
- Computing Downward Closures for Stacked Counter Automata (Q2955038) (← links)
- On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two (Q2957489) (← links)
- Recursion Schemes and the WMSO+U Logic (Q3304152) (← links)
- (Q4536396) (← links)
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond (Q5060187) (← links)
- On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems (Q5090985) (← links)
- (Q5109508) (← links)
- (Q5111264) (← links)
- Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)
- Unboundedness problems for machines with reversal-bounded counters (Q6091196) (← links)
- Existential Definability over the Subword Ordering (Q6178718) (← links)