Pages that link to "Item:Q4917028"
From MaRDI portal
The following pages link to Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028):
Displayed 4 items.
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← links)
- (Q5111633) (← links)
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)