مرکز منطقه ای اطلاع رساني علوم و فناوري - An upper bound on the derivational complexity of Knuth

Title of article :

An upper bound on the derivational complexity of Knuth–Bendix orderings

Author/Authors :

Dieter Hofbauer، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2003

Pages :

From page :

To page :

Keywords :

term rewriting , Knuth–Bendix order , Derivational complexity , Termination proofs

Journal title :

Information and Computation

Serial Year :

2003

Journal title :

Information and Computation

Record number :

262136

Link To Document :