f(0, 1,

g(

g(

R

↳Dependency Pair Analysis

F(0, 1,X) -> F(g(X,X),X,X)

F(0, 1,X) -> G(X,X)

Furthermore,

R

↳DPs

→DP Problem 1

↳Narrowing Transformation

**F(0, 1, X) -> F(g(X, X), X, X)**

f(0, 1,X) -> f(g(X,X),X,X)

g(X,Y) ->X

g(X,Y) ->Y

innermost

On this DP problem, a Narrowing SCC transformation can be performed.

As a result of transforming the rule

one new Dependency Pair is created:

F(0, 1,X) -> F(g(X,X),X,X)

F(0, 1,X'') -> F(X'',X'',X'')

The transformation is resulting in no new DP problems.

Duration:

0:00 minutes