The following pages link to (Q3338229):
Displaying 14 items.
- Verifying nilpotence (Q580975) (← links)
- The Knuth-Bendix algorithm and the conjugacy problem in monoids. (Q633198) (← links)
- A catalogue of complete group presentations (Q1097968) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- Analysis of Dehn's algorithm by critical pairs (Q1100558) (← links)
- Complexity, combinatorial group theory and the language of palutators (Q1105698) (← links)
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain (Q1111629) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- Some experiments with a completion theorem prover (Q1186705) (← links)
- The Knuth-Bendix procedure for strings as a substitute for coset enumeration (Q1192226) (← links)
- Superposition theorem proving for abelian groups represented as integer modules (Q1275020) (← links)
- Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
- Superposition theorem proving for abelian groups represented as integer modules (Q5055850) (← links)
- Confluence of algebraic rewriting systems (Q5879266) (← links)
