Constant runtime complexity of term rewriting is semi-decidable

Florian Frohn, Jürgen Giesl. Constant runtime complexity of term rewriting is semi-decidable. Inf. Process. Lett., 139:18-23, 2018. [doi]

Abstract

Abstract is missing.