1) Determine the regular expression of the regular grammar below.

RG = ({X, Y, Z}, {0, 1}, X, {X 0Y | 1Z, Y 1 | 1Z, Z 0 | 0Y})

2) Determine the regular expression of the regular language below.

L = {w | w = 01ⁿ0^m1, n > 1, m > 0}

3) Determine the language of the regular expression below.

RE1 = (h.a.t)*.d.o.g + (c.a.t)*

4) Determine the language of the regular expression below.

RE2 = a+b.c*