0 votes 0 votes Which of the following is/are true? 1) every RL is DCFL. 2) R - L is always CSL but need not be CFL. ( R is regular language and L is CFL ) Here in second statement what does they actually mean by " need not be ". Ankita Shingala asked Jan 4, 2017 Ankita Shingala 278 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes both are true every regualr is dcfl according to chomsky heiarchy (TRUE) R-L R∩CFL'= R∩CSL= CSL this is true according to closure table properties .but if language are implicility given than .closure table will give weak answer (result can be CFL or even Relugar for specific languages). Any way this statement is true (TRUE) focus _GATE answered Jan 5, 2017 selected Jan 5, 2017 by Arjun focus _GATE comment Share Follow See all 2 Comments See all 2 2 Comments reply Deepak Yadav commented Jan 5, 2017 reply Follow Share Option 1st is true to apply chomsky heiarchy . And the 2nd statement is also true but I didn't understand. So please required to explain more .. 0 votes 0 votes Ankita Shingala commented Jan 5, 2017 reply Follow Share here can we interpret R-L as the language is regular but not context free ? if yes then does there exist any language which is regular but not context free? 0 votes 0 votes Please log in or register to add a comment.