English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We study the derivational complexity of rewrite systems whose termination isprovable in the dependency pair framework using the processors for reductionpairs, dependency graphs, or the subterm criterion. We show that thederivational complexity of such systems is bounded by a multiple recursivefunction, provided the derivational complexity induced by the employed basetechniques is at most multiple recursive. Moreover we show that this upperbound is tight.

Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity