Pages that link to "Item:Q5756593"
From MaRDI portal
The following pages link to On Finite Alphabets and Infinite Bases III: Simulation (Q5756593):
Displaying 6 items.
- On finite alphabets and infinite bases (Q924717) (← links)
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? (Q979076) (← links)
- Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet (Q1944909) (← links)
- Axiomatizing weak simulation semantics over BCCSP (Q2453533) (← links)
- Foundations of Software Science and Computation Structures (Q5308450) (← links)
- Foundations of Software Science and Computation Structures (Q5899076) (← links)