0 votes 0 votes Let G1 be a context free grammar and G2 be a regular grammar.Is the problem L(G1) intersection L(G2) =phi decidable? saumya mishra asked Aug 10, 2018 saumya mishra 393 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes as we know that intersection of regular language and cfl is cfl and cfl is closed under emptyness. so yes its DECIDABLE. arvin answered Aug 10, 2018 arvin comment Share Follow See all 3 Comments See all 3 3 Comments reply srestha commented Aug 10, 2018 reply Follow Share how u got it? 0 votes 0 votes arvin commented Aug 10, 2018 reply Follow Share it asks for intersection of regular and cfl = phi ? and we know that intersection of reg and cfl is cfl. and cfl is closed under emptyness so it is decidable. 0 votes 0 votes hitesh159 commented Jan 12, 2020 reply Follow Share I think it should be decidable but in Peter Linz it is given undecidable and no reason is given 0 votes 0 votes Please log in or register to add a comment.
