State the decidability of CFG.

Statement: Every CFG is deciable, Let A be a CFL then we know that their must be CFG G a such that
L (G) = A, Now we construct a decider M_A for A as follows,

M_A = On output w, where w is some string.
Run M_CFG or <G, W>

If M_CFG accepts is “accept” otherwise “reject”.