Translate:
English
Chinese (S)
Chinese (T)
Croatian
Dutch
French
German
Hebrew
Italian
Japanese
Korean
Portuguese
Russian
Serbian
Spanish
Swedish
Turkish
Additional
Knuth–Bendix completion algorithm
English Wikipedia - The Free Encyclopedia
Download this dictionary
Knuth–Bendix completion algorithm
The
Knuth–Bendix completion algorithm
(named after
Donald Knuth
and Peter Bendix) is a
semi-decision
algorithm
for transforming a set of
equations
(over
terms
) into a
confluent
term rewriting system
. When the algorithm succeeds, it effectively solves the
word problem
for the specified
algebra
.
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License