The following pages link to (Q4270070):
Displaying 6 items.
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time (Q2851063) (← links)
- Extensions of standard weak bisimulation machinery: finite-state general processes, refinable actions, maximal-progress and time (Q2870192) (← links)
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← links)
- Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)
- Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
