Editing Knuth–Bendix completion algorithm (section)

==References==
{{Reflist}}
* {{cite book|author1=D. Knuth |author2=P. Bendix | title=Simple Word Problems in Universal Algebras| year=1970| pages=263–297| publisher=Pergamon Press| editor=J. Leech|url=https://www.cs.tufts.edu/~nr/cs257/archive/don-knuth/knuth-bendix.pdf}}
* {{cite journal| author=Gérard Huet| title=A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm| journal=J. Comput. Syst. Sci.| year=1981| volume=23| number=1| pages=11–21| url=https://hal.inria.fr/inria-00076536/file/RR-0025.pdf| doi=10.1016/0022-0000(81)90002-7}}
* C. Sims. 'Computations with finitely presented groups.' Cambridge, 1994.
* Anne Heyworth and C.D. Wensley. "[https://books.google.com/books?id=UytXH6rLUDwC&dq=%22Logged+rewriting+and+identities+among+relators%22&pg=PA256 Logged rewriting and identities among relators]."  ''Groups St. Andrews 2001 in Oxford. Vol. I,'' 256–276, London Math. Soc. Lecture Note Ser., 304, Cambridge Univ. Press, Cambridge, 2003.