The rewrite relation of the following TRS is considered.
| concat(leaf,Y) | → | Y | (1) |
| concat(cons(U,V),Y) | → | cons(U,concat(V,Y)) | (2) |
| lessleaves(X,leaf) | → | false | (3) |
| lessleaves(leaf,cons(W,Z)) | → | true | (4) |
| lessleaves(cons(U,V),cons(W,Z)) | → | lessleaves(concat(U,V),concat(W,Z)) | (5) |
final states:
{0, 1, 2}
transitions:
| leaf0 | → | 0 |
| cons0(0,0) | → | 0 |
| false0 | → | 0 |
| true0 | → | 0 |
| concat0(0,0) | → | 1 |
| lessleaves0(0,0) | → | 2 |
| concat1(0,0) | → | 3 |
| cons1(0,3) | → | 1 |
| false1 | → | 2 |
| true1 | → | 2 |
| concat1(0,0) | → | 4 |
| concat1(0,0) | → | 5 |
| lessleaves1(4,5) | → | 2 |
| cons1(0,3) | → | 3 |
| cons1(0,3) | → | 4 |
| cons1(0,3) | → | 5 |
| concat1(0,3) | → | 5 |
| concat1(0,3) | → | 4 |
| concat2(0,3) | → | 6 |
| concat2(0,3) | → | 7 |
| lessleaves2(6,7) | → | 2 |
| concat1(0,3) | → | 3 |
| 0 | → | 1 |
| 0 | → | 3 |
| 0 | → | 4 |
| 0 | → | 5 |
| 3 | → | 4 |
| 3 | → | 5 |
| 3 | → | 6 |
| 3 | → | 7 |