1 1 vote What is R-L, where R is a regular language and L is context free. Options are a.Regular, b.Context free,c.Context Sensitive ,d.None of this Theory of Computation theory-of-computation + – Abhijit Sen 886 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes R-L Reg∩cfl' Reg∩csl Csl∩csl Csl So (c) option answer focus _GATE answered Sep 22, 2016 focus _GATE comment Share Follow See all 4 Comments 4 4 Comments reply Abhijit Sen commented Sep 22, 2016 reply Follow flag Can you give some exmaple where complement of CFL is a CSL . 0 0 replyShare focus _GATE commented Sep 22, 2016 reply Follow flag L is cfl and its complemet is csl 0 0 replyShare Abhijit Sen commented Sep 22, 2016 reply Follow flag thank you. :) 1 1 replyShare Kaluti commented Oct 4, 2017 reply Follow flag reg $\cap$ cfl' as cfl is not closed under complement therfore push it up to chomsky hierarchy csl $\cap$ csl closed under intersection therfore csl here 1 1 replyShare Please log in or register to add a comment.