Home /
Expert Answers /
Advanced Math /
let-l-w-in-a-b-a-w-text-is-odd-and-b-w-text-is-even-show-that-l-pa155

Let $L = \{w \in \{a,b\}^* \ | \ \#a(w) \text{ is odd and } \#b(w) \text{ is even}\}$. Show that $L^*$ is the set of strings where the number of b's is even. I know that L*=\cup

`_{i=0}L^(i)`

I want to prove this by induction over i.