f(a, f(b, f(a,

f(b, f(b, f(b,

R

↳Dependency Pair Analysis

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Modular Removal of Rules

**F(a, f(b, f(a, x))) -> F(a, f(b, f(b, f(a, x))))**

f(a, f(b, f(a,x))) -> f(a, f(b, f(b, f(a,x))))

f(b, f(b, f(b,x))) -> f(b, f(b,x))

The original DP problem is in applicative form. Its DPs and usable rules are the following.

**F(a, f(b, f(a, x))) -> F(a, f(b, f(b, f(a, x))))**

f(b, f(b, f(b,x))) -> f(b, f(b,x))

f(a, f(b, f(a,x))) -> f(a, f(b, f(b, f(a,x))))

It is proper and hence, it can be A-transformed which results in the DP problem

**A(b(a( x))) -> A(b(b(a(x))))**

b(b(b(x))) -> b(b(x))

a(b(a(x))) -> a(b(b(a(x))))

To remove rules and DPs from this DP problem we used the following monotonic and C

Polynomial interpretation:

_{ }^{ }POL(b(x)_{1})= x _{1}_{ }^{ }_{ }^{ }POL(a(x)_{1})= x _{1}_{ }^{ }_{ }^{ }POL(A(x)_{1})= 1 + x _{1}_{ }^{ }

We have the following set D of usable symbols: {b, a, A}

No Dependency Pairs can be deleted.

No Rules can be deleted.

The result of this processor delivers one new DP problem.

Note that we keep the A-transformed DP problem as result of this processor.

R

↳DPs

→DP Problem 1

↳MRR

→DP Problem 2

↳RFC Match Bounds

**A(b(a( x))) -> A(b(b(a(x))))**

b(b(b(x))) -> b(b(x))

a(b(a(x))) -> a(b(b(a(x))))

Using RFC Match Bounds, the DP problem could be solved. The Match Bound was 1.

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

14, 15, 16, 17, 18, 19, 20, 21

Node 14 is start node and node 15 is final node.

Those nodes are connect through the following edges:

- 15 to 15 labelled #(0)
- 14 to 16 labelled A(0)
- 16 to 17 labelled b(0)
- 17 to 18 labelled b(0)
- 18 to 15 labelled a(0)
- 18 to 19 labelled a(1)
- 19 to 20 labelled b(1)
- 20 to 21 labelled b(1)
- 21 to 15 labelled a(1)
- 21 to 19 labelled a(1)

Duration:

0:00 minutes