Formal languages: intersection of l1 and l2?

187 Views Asked by At

Please help me with the next problem: given the language

$L_1=\{a^n b^m | n\geq1, m\geq 0\}$ and $L_2=\{a^n b^2 a^ {2m} | n,m\geq0\}$ construct the finite automaton of the intersection of $L_1$ and $L_2$. I don't know what I am supposed to do.