Every cfl is decidable. However, there are a number of problems for cfl’s that are not decidable. With correct knowledge and ample experience, this question becomes very easy to solve. This PDA is guaranteed to halt (I think). Decidable Problems Concerning CFLs Here we describe algorithms to test whether a CFG generates a particular string and to test whether the language of a CFG is empty. The question "Does a given DFA accept a given input" is decidable. for every CFL, G, there is a PDA M such that L (G) = L (M) and vice versa. Is the following decision problem decidable ? Whether L (G) is deterministic context free language ? I understood why the above problem is undecidable from this link, but I had a doubt. 200) Theorem 4. Express this problem as a language and show that this language is decidable For a recognizer you can ignore them; for a decider, every branch must halt. Is every regular language and CFL decidable? Yes but not vice versa. n5k5b8n il cesdo tdb iweqve s0hy gxyx ezfmpk jwl wl1r