I am new to automata theory and have a problem in understanding equivalence of regular expressions, though I can go for the construction procedure of minimized DFAs to prove that both are equal.
I need to prove the following property using different Kleene star properties:
$$(a+b)^* = b^*(ab^*)^*$$