M

Mr. Dubey • 100.69K 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
  • (C) L1, L3 can be recognized by Deterministic Push down automata
  • (D) None of the above
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The average number of key comparisons done in a successful sequential search in a list of length n is___________.

Q. The Cloudlets have a ownership unlike that of Clouds.

Q. A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of &lsq

Q. Which of the following is required when more than one person uses a central computer at the same time?

Q. What is the advantage of superheterodyning?

Q. Which method of multiple secondary communication in TDMA is acquired/adopted by bluetooth especially where data integrity becomes more crucial than av

Q. Which modulation scheme is preferred for direct sequence spread spectrum process?

Q. Method of defining a collection of hardware and software components and their interfaces to establish the framework for the development of a computer

Q. The ALU makes use of to store the intermediate results.

Q. Which of the following properties are obeyed by all three tree – traversals?

Question analytics