Question: acfg is a decidable language?
Answer: ACFG is a decidable language. We use a fact: If G is in Chomsky normal form, any derivation of w has 2n − 1 steps, where n is the length of w.