TERMIUM Plus®

The Government of Canada’s terminology and linguistic data bank.

KNUTH-BENDIX COMPLETION ALGORITHM [1 record]

Record 1 2024-05-09

English

Subject field(s)
  • Computer Mathematics
  • Computer Programs and Programming
CONT

The Knuth-Bendix completion algorithm attempts to transform a finite set of identities into a finitely terminating, confluent term rewriting system whose reductions preserve identity. This term rewriting system serves [as] a decision procedure for validating identities.

French

Domaine(s)
  • Mathématiques informatiques
  • Programmes et programmation (Informatique)
CONT

L'algorithme de Knuth-Bendix consiste à transformer un système de réécriture noethérien en un système de réécriture convergent. Il s'agit d'une procédure de complétion, qui pour chaque paire critique, regarde si elle conflue, et dans le cas où elle ne conflue pas, rajoute une règle permettant la confluence.

Spanish

Save record 1

Copyright notice for the TERMIUM Plus® data bank

© Public Services and Procurement Canada, 2024
TERMIUM Plus®, the Government of Canada's terminology and linguistic data bank
A product of the Translation Bureau

Features

Language Portal of Canada

Access a collection of Canadian resources on all aspects of English and French, including quizzes.

Writing tools

The Language Portal’s writing tools have a new look! Easy to consult, they give you access to a wealth of information that will help you write better in English and French.

Glossaries and vocabularies

Access Translation Bureau glossaries and vocabularies.

Date Modified: