The following pages link to (Q4954451):
Displaying 7 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)
- Asynchronous games. II: The true concurrency of innocence (Q2503039) (← links)
- Directed Homotopy in Non-Positively Curved Spaces (Q3300792) (← links)
- CONCURRENT AUTOMATA AND DOMAINS (Q4032921) (← links)
- A kleene theorem for recognizable languages over concurrency monoids (Q4632442) (← links)
