Q. Which of the following statement is true? (Solved)
1. All languages can be generated by CFG
2. The number of symbols necessary to simulate a Turing Machine(TM) with m symbols and n states is mn.
3. Any regular languages have an equivalent CFG.
4. The class of CFG is not closed under union.
- c. Any regular languages have an equivalent CFG.