CREATE OWN LIBRARY

Null removal or λ move removed

So we can move u to v without any string. So, we can remove,

If u is initial state, now in this case v is initial state.

If v is final state then we can assume that u is also final state.

But, 

Because after final state u, the string will be rejected for λ move to v. So, initially v is never final if u is final.

If there is any transition from v by α, 

Then we create a duplicate transition to u same as v,

[Because there is no path from u to v after λ removal]

Example:

Here we can remove last λ or first λ, it does not matter and it is not necessary that answer will be same in both cases.  RE = 0*1*2*

λ removed from first

Next removal of λ

Next removal of λ

λ removal from last position