1 votes 1 votes Whether a given context-free language is regular is decidable or undecidable? Prove your answer! Theory of Computation decidability context-free-grammar + – himgta asked Jul 29, 2018 himgta 432 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes We can use closer table . And It is a famous question. Regularity problem of CFL is undecidable . abhishekmehta4u answered Jul 29, 2018 abhishekmehta4u comment Share Follow See all 4 Comments See all 4 4 Comments reply himgta commented Jul 29, 2018 reply Follow Share I do not need any table.... I need a detailed explanation why it is undecidable! 0 votes 0 votes ROHIT SHARMA 5 commented Jul 31, 2018 reply Follow Share Go and Read 1000 pages Research paper...hopefully u will get ur point. 1 votes 1 votes anonymous commented Sep 30, 2018 reply Follow Share If u r prparing for Gate dont go for the proof for this it will take months of time even after spending months of time it is not sure that u will definately get it..dont go for the proof please just Byheart it. 0 votes 0 votes mrdeepak01 commented Oct 25, 2018 reply Follow Share Is it partially decidable? Because DCFL is decidable in table 0 votes 0 votes Please log in or register to add a comment.
