This page implements the
Knuth-Bendix algorithm
for finitely-presented monoids (including groups).
Given a set of word equations, it generates a set of rewriting rules
that (when applied exhaustively to substrings) reduces any word to its
smallest equivalent form.
Equations
(word=word, whitespace-delimited, words can be empty,
(...)^n for repetition):
Suggested inverse-defining equations:
.
Starting...
Words to reduce / equations to check:
Reduction results:
Generators to use for enumeration (leave blank for default):