0 votes 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! Theory of Computation theory-of-computation regular-language set-theory&algebra + – smartmeet asked Jan 12, 2017 retagged Jun 4, 2017 by Arjun smartmeet 2.8k views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Mandeep Singh commented Jan 12, 2017 reply Follow Share 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. 0 votes 0 votes smartmeet commented Jan 12, 2017 reply Follow Share Any anti-examplewhich is in L but not in R. Arent they same languages? 0 votes 0 votes Mandeep Singh commented Jan 12, 2017 reply Follow Share 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. 1 votes 1 votes smartmeet commented Jan 13, 2017 reply Follow Share Thanks bro got it! 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes 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. Jason GATE answered Jan 25, 2017 Jason GATE comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 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. IamRishabh answered Jan 12, 2017 IamRishabh comment Share Follow See all 0 reply Please log in or register to add a comment.