Decidablity

Question

Every CFL is decidable ? Why

Answer 1

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.