f(a,

g(a) -> b

g(b) -> b

R

↳Dependency Pair Analysis

F(a,y) -> F(y, g(y))

F(a,y) -> G(y)

Furthermore,

R

↳DPs

→DP Problem 1

↳Usable Rules (Innermost)

**F(a, y) -> F(y, g(y))**

f(a,y) -> f(y, g(y))

g(a) -> b

g(b) -> b

innermost

As we are in the innermost case, we can delete all 1 non-usable-rules.

R

↳DPs

→DP Problem 1

↳UsableRules

→DP Problem 2

↳Narrowing Transformation

**F(a, y) -> F(y, g(y))**

g(b) -> b

g(a) -> b

innermost

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

As a result of transforming the rule

two new Dependency Pairs are created:

F(a,y) -> F(y, g(y))

F(a, b) -> F(b, b)

F(a, a) -> F(a, b)

The transformation is resulting in no new DP problems.

Duration:

0:00 minutes