This Notebook is an implementation of the Knuth Bendix procedure in Mathematica. The goal is to solve the word problem in groups. Partial implementation at this point. This uses Finite State Automata and Word Difference the Knuth Bendix algorithm. This code remains to be debugged.
An example of graphic with:
I (Rémi) wonder whether this question could be tackled directly by means of a rule based approach. I do not know a lot about those questions but I have noticed tight links between automata (I mean their procedural approach) and transformation rules. Very roughly, automata (their associated grammars, actually) can be defined by sets of transformation rules and implemented with Fold. Perhaps such implementations are less efficient but they make the underlying mathematical aspects more clear.
Back to Workgroups