Pages that link to "Item:Q5055749"

The following pages link to Time bounded rewrite systems and termination proofs by generalized embedding (Q5055749):

Displaying 2 items.

• An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
• Time bounded rewrite systems and termination proofs by generalized embedding (Q5055749) (← links)