The following pages link to (Q3714064):
Displaying 9 items.
- Using string-rewriting for solving the word problem for finitely presented groups (Q580494) (← links)
- Groups and NTS languages (Q580992) (← links)
- On deciding whether a monoid is a free monoid or is a group (Q1075439) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Unification theory (Q1124375) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- Commutativity in groups presented by finite Church-Rosser Thue systems (Q3794395) (← links)
- Divergence phenomena during completion (Q5055775) (← links)
- Conditional semi-Thue systems for presenting monoids (Q5096810) (← links)
