function BDD2FDD(b)

if isLeaf(b) return b;

else

F1 := BDD2FDD(high(b));

F0 := BDD2FDD(low(b));

h := Apply(⊕, F1, F0);

return CreateFddNode(label(b), h, F0);

function FDD2BDD(f )

if isLeaf(f ) return f ;

else

B1 := FDD2BDD(high(f ));

B0 := FDD2BDD(low(f ));

h := Apply(⊕, B1, B0);

return CreateBddNode(label(f ), h, B0);

Sorry I couldn't understand the difference between the two algorithm functions.

Could you reference it in the function exactly?