Pages that link to "Item:Q5415622"
From MaRDI portal
The following pages link to Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622):
Displaying 8 items.
- A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable (Q1075060) (← links)
- BPA bisimilarity is EXPTIME-hard (Q1943623) (← links)
- Modifications of expansion trees for weak bisimulation in BPA (Q2842872) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- (Q4270070) (← 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)
- Algebra and Coalgebra in Computer Science (Q5492813) (← links)