Computer Science, asked by abhishekdubey13, 6 months ago

Consider two grammars G1 = (v1, Epsilon, S1, Pl) and G2 = ( V2,Epsilon ,
S2, P2). Gl is left-linear and G2 is right-linear. The sets V1 and V2 have the
following
property: V1 intersection V2 = phi . Is the language L(G1) U L(G2) regular?

Answers

Answered by kavitashinde191
0

Answer:

Yes we use language regular

Similar questions