Pages that link to "Item:Q4630301"
From MaRDI portal
The following pages link to From domains to automata with concurrency (Q4630301):
Displaying 7 items.
- Recognizable languages in concurrency monoids (Q672317) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- From Petri nets to automata with concurrency (Q1610275) (← links)
- Automata for true concurrency properties (Q1652979) (← links)
- A kleene theorem for recognizable languages over concurrency monoids (Q4632442) (← links)
- Languages and logical definability in concurrency monoids (Q6560171) (← links)