The following pages link to (Q3951525):
Displayed 8 items.
- Derivation tree analysis for accelerated fixed-point computation (Q549189) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- A note on an expressiveness hierarchy for multi-exit iteration (Q1014386) (← links)
- Merging regular processes by means of fixed-point theory (Q1082070) (← links)
- Rule formats for distributivity (Q1758150) (← links)
- The max-plus algebra of the natural numbers has no finite equational basis (Q1870591) (← links)
- Timing and causality in process algebra (Q1924998) (← links)