Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main Page
Community portal
Requested entries
Recent changes
Random entry
Help
Glossary
Contact us
Search
Search
Appearance
Donations
Create account
Log in
Personal tools
Donations
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Contents
move to sidebar
hide
Beginning
1
English
Toggle English subsection
1.1
Etymology
1.2
Proper noun
Toggle the table of contents
Knuth-Bendix completion algorithm
Not in other languages
Entry
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Print/export
Create a book
Download as PDF
Printable version
In other projects
Appearance
move to sidebar
hide
From Wiktionary, the free dictionary
English
[
edit
]
English
Wikipedia
has an article on:
Knuth-Bendix completion algorithm
Wikipedia
Etymology
[
edit
]
Named after
Donald Knuth
and Peter Bendix.
Proper noun
[
edit
]
Knuth
-
Bendix
completion
algorithm
(
computing
theory
)
A
semidecision
algorithm
for
transforming
a
set
of
equations
(over
terms
) into a
confluent
term
rewriting
system
.
Categories
:
English lemmas
English proper nouns
English uncountable nouns
English multiword terms
en:Theory of computing
English eponyms
Hidden categories:
Pages with entries
Pages with 1 entry
