.png)
14 hours ago
2
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, word can be empty, (...)^n for repetition):
Ignoring malformed equations.
Suggested inverse-defining equations: .
Words to reduce (whitespace-delimited):
