automata6

Question

Comments

if L2=sigma* then L4 will be regular so yes its possible that L4 is regular.

---

Utkarsh Joshi

pls check this

L4=L1.L2.L3

this means strings accepted by L1 concatenated by string accepted by L2 and then concatenated by string accepted by L2 right.

if L1= aⁿbⁿ

L2=sigma*

L3=ww^R; w belongs to (u,v)⁺ 

then can we say L4 is regular??

pls tell me this ;i am confused now!!

---

You can say it as regular if you allow n>=0 in a^nb^n and WW^r, |w|>=0. By doing so u can always generate any strings in sigma* assuming other two non regular languages as epsilon.