The following pages link to (Q4449168):
Displayed 7 items.
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Ready to preorder: an algebraic and general proof (Q843212) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- On finite alphabets and infinite bases (Q924717) (← links)
- (Bi)simulations up-to characterise process semantics (Q1012122) (← links)
- (Q5028469) (← links)
- (Q5089283) (← links)