Consider the following context free languages: L1 = {0^i 1^j 2^k | i+j = k} L2 = {0^i 1^j 2^k | i = j or j = k} L3 = {0^i 1^j | i = 2j+1} Which of the following option is true?

Mr. Dubey • 52.26K Points
Coach

Q. Consider the following context free languages:
L1 = {0^i 1^j 2^k | i+j = k}
L2 = {0^i 1^j 2^k | i = j or j = k}
L3 = {0^i 1^j | i = 2j+1}
Which of the following option is true?

(A) L1, L2 and L3 can be recognized by Deterministic Push down automata

(B) L1, L2 can be recognized by Deterministic Push down automata

(D) None of the above

Correct : Option (C)

Discusssion

Be the first to start discuss.

Q. What is the worst case time complexity of a quick sort algorithm?

Q. Chromosomes are actually ?

Q. In comparison to M-ary PSK, M-ary QAM bandwidth efficiency is and power efficiency is

Q. A data type that creates unique numbers for key columns in Microsoft Access is:

Q. What is the binary equivalent of the decimal number 368

Q. Which of the following is a form of DoS attack ?

Q. protocol is used for Streaming Media over

Q. In the __________ normal form, a composite attribute is converted to individual attributes.

Q. Which of the following cloud concept is related to pooling and sharing of resources?

Q. Consider the following context free languages: L1 = {0^i 1^j 2^k | i+j = k} L2 = {0^i 1^j 2^k | i = j or j = k} L3 = {0^i 1^j | i = 2j+1} Which of the following option is true?

Discusssion

Related MCQs