Pages that link to "Item:Q2380016"
From MaRDI portal
The following pages link to A note on emptiness for alternating finite automata with a one-letter alphabet (Q2380016):
Displaying 10 items.
- Reachability on prefix-recognizable graphs (Q975403) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- Bounds for synchronizing Markov decision processes (Q2097220) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- A note on the emptiness problem for alternating finite-memory automata (Q2437765) (← links)
- Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) (← links)
- (Q4558784) (← links)
- Optimally Resilient Strategies in Pushdown Safety Games (Q5089248) (← links)
- Countdown games, and simulation on (succinct) one-counter nets (Q5883735) (← links)
- Parity games on temporal graphs (Q6629452) (← links)