The following pages link to (Q3659975):
Displaying 11 items.
- Square-free graphs are multiplicative (Q345100) (← links)
- The Nielsen reduction and P-complete problems in free groups (Q760500) (← links)
- Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
- On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
- Decidability and independence of conjugacy problems in finitely presented monoids (Q1637219) (← links)
- Implementation of the Nielsen algorithm in the algebraic programming system APS-1 (Q1905209) (← links)
- Efficient solution of some problems in free partially commutative monoids (Q2640345) (← links)
- A note on thue systems with a single defining relation (Q3735697) (← links)
- Finite canonical rewriting systems for congruences generated by concurrency relations (Q3779772) (← links)
- A note on special thue systems with a single defining relation (Q4740555) (← links)
- Homomorphism Reconfiguration via Homotopy (Q5212954) (← links)