Pages that link to "Item:Q1109139"
From MaRDI portal
The following pages link to The word problem for free partially commutative groups (Q1109139):
Displayed 9 items.
- On properties not inherited by monoids from their Schützenberger groups. (Q549674) (← links)
- Security analysis of word problem-based cryptosystems (Q849353) (← links)
- Word problems over traces which are solvable in linear time (Q914395) (← links)
- The submonoid and rational subset membership problems for graph groups. (Q947493) (← links)
- Partially commutative inverse monoids. (Q958191) (← links)
- Trace monoids with some invertible generators: Two decision problems (Q1179186) (← links)
- On the Knuth-Bendix completion for concurrent processes (Q1262753) (← links)
- Graph groups are biautomatic (Q1331906) (← links)
- COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS (Q4904513) (← links)