Word.ws English Dictionary

Knuth-Bendix completion algorithm

Knuth-Bendix completion algorithm proper noun: a semidecision algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.

Proper noun

Knuth-Bendix completion algorithm

  1. A semidecision algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.

Origin of Knuth-Bendix completion algorithm

Named after Donald Knuth and Peter Bendix.

Questions about Knuth-Bendix completion algorithm

What does Knuth-Bendix completion algorithm mean?
Knuth-Bendix completion algorithm means a semidecision algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
What part of speech is Knuth-Bendix completion algorithm?
Knuth-Bendix completion algorithm is a proper noun.

Words near Knuth-Bendix completion algorithm in the dictionary

  1. Knusts
  2. knut
  3. Knute
  4. Knuth
  5. Knuth equivalence
  6. Knuth-Bendix completion algorithm
  7. Knuth-Morris-Pratt algorithm
  8. Knuthian
  9. Knuths
  10. knuts
  11. Knutsford

Source and license

Adapted from Wiktionary: Knuth-Bendix completion algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Knuth-Bendix completion algorithm.” Word.ws, https://word.ws/knuth-bendix_completion_algorithm. Based on Wiktionary, CC BY-SA 4.0.