An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942): Difference between revisions
From MaRDI portal
Latest revision as of 08:57, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An upper bound on the derivational complexity of Knuth-Bendix orderings. |
scientific article |
Statements
An upper bound on the derivational complexity of Knuth-Bendix orderings. (English)
0 references
19 August 2003
0 references
Term rewriting
0 references
Termination proofs
0 references
Knuth-Bendix order
0 references
Derivational complexity
0 references
0 references