Q. Consider the following statements:

A1: Every regular language is the subset of context free language.

B1: For every regular grammar there exists a corresponding context free grammar.

C1: For every recursive language there exists a corresponding recursive enumerable language.

D1: Finding the total number of digits in PIE is possible in a diagonal language.

Which one of the following is CORRECT?

A. Only 1.

B. Only 1,2

C. Only 3,4

D. All of the above

### Question stats

Question and answer is powered by AnsPress