
Good evening
Doing this exercise, I found two regular expressions for L1 and L2 (so they are regular languages).
Looking at L3 , using pumping lemma on the string abnabna ∈ L3, i concluded that the language is not regular. But looking at the language's structure, it also seems to me that the third one is the intersection of the first two languages, which are regular, so it should also be regular. What am I doing wrong? Is L3 actually the intersection of the first two languages?
Thanks for the attention