The following pages link to (Q3395948):
Displaying 7 items.
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)