The intersection of CFL and regular language
| A. | is always regular |
| B. | is always context free |
| C. | both (a) and (b) |
| D. | need not be regular |
Answer : B Explanation : Jaya said: (6:01pm on Friday 1st February 2013)
I have a doubt that the correct answer should be B- is always Context free
ads said: (2:06am on Friday 18th October 2013)
answer is D because if {fae}intersection{a*b*}so answer is regular
ads said: (2:07am on Friday 18th October 2013)
answer is D because if {fae}intersection{a*b*}so answer is regular
imran said: (8:36pm on Sunday 24th December 2017)
if we have intersection of set of A ( being regular) with B ( being a CF) then result will always be empty or finite or at maximum A.. in every case the result will be a regular language. so the correct option seems D. for example intersection of (a b)* and EQUAL will be language Equal, hence a CF language. also by definition every language which is Regular is also CF by definition. hence option A, C can never occur. so correct option is B only. Plz give some example that result can be a non Context Free language to advocate that correct option as D
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
