0 votes 0 votes Wanted asked Jan 23, 2017 Wanted 252 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes I am not sure, But I am gonna go with D. Recursive. L1,L2: CSL L3: CFL L=L1.L2-L3 = L1.L2 intersect L3' =CSL.CSL intersect CFL' =CSL.CSL intersect Recursive = CSL.Recursive (not sure about this step) =Recursive. Abbas2131 answered Jan 23, 2017 Abbas2131 comment Share Follow See all 3 Comments See all 3 3 Comments reply Wanted commented Jan 23, 2017 reply Follow Share but i think every csl is recursive but every recursive is not csl right? so yar i think CSL is answer. 0 votes 0 votes Abbas2131 commented Jan 23, 2017 reply Follow Share But here we are concatenating it with recursive language. Consider this: If u are having a csl followed by a RL for analysis of csl we need a LPDA and for RL a Turing machine. No matter what, we need to analyse both languages. Therefore we need (LPDA)U(TM) And since TM can also analyse CSL therefore LPDA can be considered a subset of TM. Thats why I THINK the answer is Recursive. 0 votes 0 votes Wanted commented Jan 23, 2017 reply Follow Share But here we are concatenating it with recursive language.? i think we are intersecting it ...check again 0 votes 0 votes Please log in or register to add a comment.