Wiktionary

Knuth-Bendix completion algorithm

English

edit
 
Wikipedia

Etymology

edit

Named after Donald Knuth and Peter Bendix.

Proper noun

edit

Knuth-Bendix completion algorithm

  1. (computing theory) A semidecision algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
Retrieved from "https://en.wiktionary.org/w/index.php?title=Knuth-Bendix_completion_algorithm&oldid=77954786"