I am quite new to Discrete Math and having lots of troubles solving the problems in it.
Currently, I am struggling with a problem:
Prove by induction that if $A$ and $B$ are regular expressions over one-letter alphabet and if $n$ is any natural, prove that languages $(AB)^n$ and $A^nB^n$ are equal.
Thanks