Consider the following statements:

(A) For every regular language, we can design Turing Machine

(B) For every context free language, we can design Turing Machine Which of the following is correct?

1. AStatement-A is false and Statement-B is true.
2. BStatement-A and Statement-B both are false. B
3. CStatement-A is true and Statement- is false.
4. DStatement-A and Statement-B both are true.

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: D. Statement-A and Statement-B both are true.

Explanation

Turing machines can recognize every regular and every context-free language, since those classes sit inside the recursive languages.