Pages that link to "Item:Q672317"
From MaRDI portal
The following pages link to Recognizable languages in concurrency monoids (Q672317):
Displayed 9 items.
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Synchronization expressions with extended join operation (Q1274985) (← links)
- Complete positive group presentations. (Q1409747) (← links)
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables. (Q1854303) (← links)
- Finite transducers for divisibility monoids (Q2508976) (← links)
- Topology for Computations of Concurrent Automata (Q4354233) (← 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)
- Synthesis of Safe Message-Passing Systems (Q5458841) (← links)