First time here? Checkout the FAQ!
0 votes
We know, here R subset L so by formula R intersection L= R, but for any string R=L( both language are same) R intersection L can be R or L?

Correct me!
asked in Theory of Computation by Loyal (3.2k points)   | 77 views
L and R are both languages ( set of strings) not a single string. In fact L is set of all possible strings over a,b and R is definitely a subset of L. There may be many common strings and intersection of both languages is R only bcoz its a proper subset.
Any anti-examplewhich is in L but not in R. Arent they same languages?
aabbbaaaabbb this is not in R. So pattern in R is a encloses b or not present at all but can not be present in interleaved manner.
Thanks bro got it!

2 Answers

+1 vote

It is same thing what we do in Set Theory,

Universe U={1,2,3,4,..,8,9,10}


U ∩ A = A                      {Always.}

Now Relate L with U that is Simply the Universal Language And R is one of the Subsets of it.

So,L ∩ R will always be R here in this case.

answered by Loyal (2.5k points)  
0 votes
In this given question there are some string possible in "L" which are not possible in "R" example string "abab" but all string possible in "R" is possible in "L". So here .."L intersection R"  is "R" for sure.
answered by Junior (579 points)  

Top Users Mar 2017
  1. rude

    4272 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2608 Points

  5. Debashish Deka

    2254 Points

  6. 2018

    1514 Points

  7. Vignesh Sekar

    1344 Points

  8. Akriti sood

    1262 Points

  9. Bikram

    1258 Points

  10. Sanjay Sharma

    1016 Points

Monthly Topper: Rs. 500 gift card

21,454 questions
26,775 answers
22,994 users