TERMIUM Plus®

From: Translation Bureau

On social media

Consult the Government of Canada’s terminology data bank.

ALGORITHME COMPLETION [1 record]

Record 1 2020-11-04

English

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

An algorithm designed to complete a set of term-rewriting rules to have the most desired property of being confluent.

CONT

As defined in universal algebra, identities are equalities of two terms: x=y. Presumably, the values of the two terms are equal for all values of variables occurring in them. A reduction order is another input to the completion algorithm provided that every identity is viewed as two candidates for rewrite rules transforming the left-hand side into the right-hand side and vice versa.

French

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

L'algorithme Knuth-Bendix est un algorithme de complétion. Il prend en entrée un ensemble d'équations qu'il va transformer en règles de réécriture.

Spanish

Save record 1

Copyright notice for the TERMIUM Plus® data bank

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

Features

GCtranslate (available on the Government of Canada network only)

Use this artificial intelligence prototype to translate Government of Canada content up to and including Protected B. Available to employees of selected departments and agencies only.

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: