0 votes 0 votes Let L(G) be the language generated by a context free grammar G. Whether L(G) is deterministic context free language or not. Is the above problem is decidable? Kaushal Sanadhya asked Sep 14, 2018 Kaushal Sanadhya 264 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply manisha11 commented Sep 14, 2018 reply Follow Share probably yes 0 votes 0 votes Kaushal Sanadhya commented Sep 14, 2018 reply Follow Share How? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Yes , because for the language generated by cfl if we can design dpda (deterministic push down automata) then it is dcfl else it is not dcfl . Manas Mishra answered Sep 14, 2018 Manas Mishra comment Share Follow See all 0 reply Please log in or register to add a comment.