The following pages link to (Q2754192):
Displayed 9 items.
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- Unique parallel decomposition in branching and weak bisimulation semantics (Q896916) (← links)
- On finite alphabets and infinite bases (Q924717) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- Decomposition orders -- another generalisation of the fundamental theorem of arithmetic (Q1781996) (← links)
- (Q5028469) (← links)
- (Q5089283) (← links)
- The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems (Q5262950) (← links)