in Theory of Computation
1,209 views
0 votes
0 votes
A)L(r1)⊆L(r2) and L(r3)⊆L(r2)

b) L(r2)⊆L(r1)  and L(r2)⊆L(r3)

C) L(r1)=L(r3)⊆L(r2)

D) L(r1)⋃L(r3)=L(r2)

plz explain with explanation
in Theory of Computation
1.2k views

1 Answer

4 votes
4 votes
Best answer

plz correct me.....

selected by

1 comment

I agree with the solution and the last part

L(r2) ⊆ L(r1) U L(r3)

Because language produced by r2 is Either only streams of a's or only streams of b's but not both.

Moreover, both L(r1) and L(r3) when mixed together(Union) can handle cases of when we have only streams of a's or streams of b's which is the language generated by L(r2)
1
1

Related questions