GATE CSE
First time here? Checkout the FAQ!
x
0 votes
90 views
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.3k points)  
retagged by | 90 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}

A={1,2,3}

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.6k 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 (629 points)  


Top Users Jul 2017
  1. Bikram

    4062 Points

  2. manu00x

    2464 Points

  3. Debashish Deka

    1850 Points

  4. joshi_nitish

    1658 Points

  5. Arjun

    1294 Points

  6. Hemant Parihar

    1184 Points

  7. Arnab Bhadra

    1112 Points

  8. Shubhanshu

    1054 Points

  9. Ahwan

    900 Points

  10. rahul sharma 5

    706 Points


24,022 questions
30,966 answers
70,346 comments
29,342 users