0 votes 0 votes Every CFL is decidable ? Why Deepesh Pai 1 asked Nov 25, 2018 Deepesh Pai 1 177 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Every CFL has a PDA, so there is logic for all valid strings in that CFL (valid strings will reach final state). And there is also logic for invalid strings (they will halt at non final state, but they will definitely halt). Hence its Decidable. Chaitrasj answered Nov 25, 2018 Chaitrasj comment Share Follow See all 0 reply Please log in or register to add a comment.
