Pages that link to "Item:Q1605337"
From MaRDI portal
The following pages link to Axiomatizing the subsumption and subword preorders on finite and infinite partial words (Q1605337):
Displaying 9 items.
- Nonexistence of a Kruskal-Katona type theorem for subword orders (Q705744) (← links)
- Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\) (Q783293) (← links)
- Two equational theories of partial words (Q1643141) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- Schedulers and finishers: on generating and filtering the behaviours of an event structure (Q1786565) (← links)
- Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
- Posets with interfaces as a model for concurrency (Q2672275) (← links)
- Definability in the Subword Order (Q3576212) (← links)
- Convolution and concurrency (Q5084483) (← links)