Pages that link to "Item:Q5317186"
From MaRDI portal
The following pages link to The Bisimulation Problem for Equational Graphs of Finite Out-Degree (Q5317186):
Displayed 3 items.
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)