Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Consider ∑ = {w, x} and T = {x, y, z}. Define homomorphism h by:
h(x) = xzy
h(w) = zxyy
If L is the regular language denoted by r = (w + x*)(ww)*, then the regular language h(L) is given by1
(z x yy + x z y) (z x yy)
2
(zxyy + (xzy)*)(zxyy zxyy)*
3
(zxyy + xzy)(zxyy)*
4
(zxyy + (xzy)*)(zxyy zxyy)