The following pages link to (Q4449204):
Displayed 7 items.
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
- DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- (Q4558784) (← links)
- (Q5089314) (← links)
- Countdown games, and simulation on (succinct) one-counter nets (Q5883735) (← links)