Pages that link to "Item:Q1102124"

The following pages link to Rewriting systems and word problems in a free partially commutative monoid (Q1102124):

Displaying 11 items.

• Word problems over traces which are solvable in linear time (Q914395) (← links)
• Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule (Q1107523) (← links)
• The word problem for free partially commutative groups (Q1109139) (← links)
• Trace monoids with some invertible generators: Two decision problems (Q1179186) (← links)
• On the Knuth-Bendix completion for concurrent processes (Q1262753) (← links)
• On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758) (← links)
• Parabolic and quasiparabolic subgroups of free partially commutative groups. (Q2470378) (← links)
• Overlaps in free partially commutative monoids (Q2639969) (← links)
• Efficient solution of some problems in free partially commutative monoids (Q2640345) (← links)
• On confluence of one-rule trace-rewriting systems (Q4841768) (← links)
• Word problems over traces which are solvable in linear time (Q5096152) (← links)