Pages that link to "Item:Q5096916"

The following pages link to Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable (Q5096916):

Displaying 3 items.

• A note on the commutative closure of star-free languages (Q672729) (← links)
• Two techniques in the area of the star problem in trace monoids (Q1884907) (← links)
• Computing the closure of sets of words under partial commutations (Q4645168) (← links)