Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Knuth–Bendix_completion_algorithm> ?p ?o. }
Showing items 1 to 19 of
19
with 100 items per page.
- Knuth–Bendix_completion_algorithm abstract "The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an 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. An important case in computational group theory are string rewriting systems which can be used to give canonical labels to elements or cosets of a finitely presented group as products of the generators. This special case is the current focus of this article.Buchberger's algorithm for computing Gröbner bases is a very similar algorithm. Although developed independently, it may also be seen as the instantiation of Knuth-Bendix algorithm in the theory of polynomial rings.".
- Knuth–Bendix_completion_algorithm wikiPageID "614147".
- Knuth–Bendix_completion_algorithm wikiPageRevisionID "590753584".
- Knuth–Bendix_completion_algorithm title "Knuth–Bendix Completion Algorithm".
- Knuth–Bendix_completion_algorithm urlname "Knuth-BendixCompletionAlgorithm".
- Knuth–Bendix_completion_algorithm subject Category:Combinatorics_on_words.
- Knuth–Bendix_completion_algorithm subject Category:Computational_group_theory.
- Knuth–Bendix_completion_algorithm subject Category:Donald_Knuth.
- Knuth–Bendix_completion_algorithm subject Category:Rewriting_systems.
- Knuth–Bendix_completion_algorithm comment "The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an 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. An important case in computational group theory are string rewriting systems which can be used to give canonical labels to elements or cosets of a finitely presented group as products of the generators.".
- Knuth–Bendix_completion_algorithm label "Algorithme de Knuth-Bendix".
- Knuth–Bendix_completion_algorithm label "Knuth–Bendix completion algorithm".
- Knuth–Bendix_completion_algorithm label "クヌース・ベンディックス完備化アルゴリズム".
- Knuth–Bendix_completion_algorithm sameAs Knuth%E2%80%93Bendix_completion_algorithm.
- Knuth–Bendix_completion_algorithm sameAs Algorithme_de_Knuth-Bendix.
- Knuth–Bendix_completion_algorithm sameAs クヌース・ベンディックス完備化アルゴリズム.
- Knuth–Bendix_completion_algorithm sameAs Q2835803.
- Knuth–Bendix_completion_algorithm sameAs Q2835803.
- Knuth–Bendix_completion_algorithm wasDerivedFrom Knuth–Bendix_completion_algorithm?oldid=590753584.