I know how to write pseudo code for proving C is CFG but how do i prove it generates infinite number of strings?
Prove that this language is Turing-decidable by designing Turing machine pseudocode for a machine that decides it.
L1 = {〈C〉|C is a CFG and C generates infinite strings}