Pages that link to "Item:Q3569030"
From MaRDI portal
The following pages link to An elementary bisimulation decision procedure for arbitrary context-free processes (Q3569030):
Displaying 5 items.
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
- Polymorphic higher-order context-free session types (Q6499549) (← links)
