The following pages link to BPA bisimilarity is EXPTIME-hard (Q1943623):
Displaying 10 items.
- Bisimilarity on basic parallel processes (Q2072066) (← links)
- Equivalence of pushdown automata via first-order grammars (Q2208249) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
- (Q4558784) (← links)
- (Q5111633) (← links)
- Deciding the Bisimilarity of Context-Free Session Types (Q5164167) (← links)
- Countdown games, and simulation on (succinct) one-counter nets (Q5883735) (← links)
- Polymorphic higher-order context-free session types (Q6499549) (← links)
- System \(F^\mu_\omega\) with context-free session types (Q6535246) (← links)