Pages that link to "Item:Q1346626"
From MaRDI portal
The following pages link to Labelled domains and automata with concurrency (Q1346626):
Displaying 8 items.
- Recognizable languages in concurrency monoids (Q672317) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Stable trace automata vs. full trace automata (Q1276249) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- Topology for Computations of Concurrent Automata (Q4354233) (← links)
- From domains to automata with concurrency (Q4630301) (← links)
- A kleene theorem for recognizable languages over concurrency monoids (Q4632442) (← links)
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA (Q5248980) (← links)
