Given a list of rewrite rules of the form (left,right), and a word, rewrite it by repeatedly replacing any left substring in the word by the corresponding right
Implementation of the Knuth-Bendix algorithm. Given a list of relations, return a confluent rewrite system. The algorithm is not guaranteed to terminate.
Given generators and a confluent rewrite system, return (normal forms of) all elements
Given generators and relations, return (normal forms of) all elements