The following pages link to (Q4496250):
Displayed 7 items.
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159) (← links)
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata (Q2391861) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- An Automata-Theoretical Characterization of Context-Free Trace Languages (Q3075533) (← links)
- CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store (Q3117547) (← links)
- Countdown games, and simulation on (succinct) one-counter nets (Q5883735) (← links)