TOC

Question

If a language L is not regular then homomorphism h(L) ?

1. Regular
2. Not regular
3. Need not regular.

Answer 1

Let L={0ⁿ1ⁿ | n>0}

h(0)=ab

h(1)=ba

h(L)={(ab)ⁿ (ba)ⁿ | n>0}

If L is non regular then h(L) also non regular

https://courses.engr.illinois.edu/cs373/fa2010/lectures/lect09-10.pdf

Comments

If L={0ⁿ1ⁿ} and  h(0)=a , h(1)=b then h(L)={aⁿbⁿ  | n>0}

---

yes

---

answer should be need not be regular