Pages that link to "Item:Q2842876"
From MaRDI portal
The following pages link to Uniform solution of parity games on prefix-recognizable graphs (Q2842876):
Displaying 10 items.
- Efficient CTL model-checking for pushdown systems (Q402129) (← links)
- Games with winning conditions of high Borel complexity (Q817850) (← links)
- Reachability on prefix-recognizable graphs (Q975403) (← links)
- Note on winning positions on pushdown games with \(\omega\)-regular conditions (Q1007544) (← links)
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) (Q2437851) (← links)
- Efficient CTL Model-Checking for Pushdown Systems (Q3090847) (← links)
- Games on Multi-stack Pushdown Systems (Q3605543) (← links)
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes (Q3617724) (← links)
- Games on Higher Order Multi-stack Pushdown Systems (Q3646264) (← links)
- Solving Infinite Games in the Baire Space (Q5038566) (← links)