1 votes 1 votes Given two deterministic CFG G$_1$ and G$_2$, is L( G$_1$ ) = L( G$_2$ ) ? Theory of Computation decidability theory-of-computation context-free-language + – Shamim Ahmed asked Nov 1, 2018 edited Dec 4, 2018 by Shaik Masthan Shamim Ahmed 1.2k views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Verma Ashish commented Nov 1, 2018 reply Follow Share See the table..it is decidable for det. cfg and UD for cfg 1 votes 1 votes Rishav Kumar Singh commented Nov 1, 2018 reply Follow Share It was undecidable untill in 1997 scientist named Géraud Sénizergues proved that equivalence of DCFLs is decidable. 2 votes 2 votes kumar.dilip commented Nov 7, 2018 reply Follow Share See here https://gateoverflow.in/?qa=blob&qa_blobid=11546874903886419756 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes decidable for DCFL soubhik baral answered Nov 7, 2018 soubhik baral comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Answer is Decidable in case of Deterministic CFL. But if we talk in wider context that is of CFL (Deterministic and non deterministic combined ) , this becomes Undecidable. Zartab Ali answered Nov 12, 2018 Zartab Ali comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Its decidable rish1602 answered Jul 1, 2021 rish1602 comment Share Follow See all 0 reply Please log in or register to add a comment.