Pages that link to "Item:Q1959482"
From MaRDI portal
The following pages link to Complexity of deciding bisimilarity between normed BPA and normed BPP (Q1959482):
Displaying 9 items.
- Comparing expressibility of normed BPA and normed BPP processes (Q1306565) (← links)
- BPA bisimilarity is EXPTIME-hard (Q1943623) (← links)
- Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time (Q2851063) (← links)
- Deciding Bisimilarity of Full BPA Processes Locally (Q3540084) (← links)
- (Q4222869) (← links)
- Complexity of weak bisimilarity and regularity for BPA and BPP (Q4461214) (← links)
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← links)
- Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences (Q5179048) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900564) (← links)