Pages that link to "Item:Q4236208"
From MaRDI portal
The following pages link to A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces (Q4236208):
Displaying 10 items.
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- A complete equational axiomatization for MPA with string iteration (Q1274456) (← links)
- On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (Q1274921) (← links)
- Nonaxiomatisability of equivalences over finite state processes (Q1377607) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- Language preorder as a precongruence (Q1575654) (← links)
- The max-plus algebra of the natural numbers has no finite equational basis (Q1870591) (← links)
- Axiomatizations for the perpetual loop in process algebra (Q4571987) (← links)
- Non-regular iterators in process algebra (Q5958616) (← links)
