Theory of Computing Combining grammar rules of two languages...

where L1 starts with S1 and

L2 starts with S2

S -> what??? for each of the following

##Inter1* S -> ???? for L1 U L2

##Inter2* S -> ???? for L1 L2

##Inter4* S1 -> ???? (describe) for f(a) = L2

##Inter7* L is ww where w is made up of a's and b's.

(two identical parts)

What regular expression should we intersect L with

to get a^n b^m a^n b^m which is not CFL.

RE is:

##Inter9* L if finite iff there exits no