Pages that link to "Item:Q672317"

The following pages link to Recognizable languages in concurrency monoids (Q672317):

Displaying 5 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)