Pages that link to "Item:Q5096251"
From MaRDI portal
The following pages link to Compositional relational semantics for indeterminate dataflow networks (Q5096251):
Displaying 8 items.
- Recognizable languages in concurrency monoids (Q672317) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Context-free event domains are recognizable (Q1286370) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- From domains to automata with concurrency (Q4630301) (← links)
- A kleene theorem for recognizable languages over concurrency monoids (Q4632442) (← links)
- Context-free event domains are recognizable (Q5096387) (← links)
- Connections between a concrete and an abstract model of concurrent systems (Q5887511) (← links)
