M

Mr. Dubey • 100.69K Points
Coach

Q. The following grammar
G = (N, T, P, S)
N = {S, A, B}
T = {a, b, c}
P : S → aSa
S → aAa
A → bB
B → bB
B → c is

  • (A) is type 3
  • (B) is type 2 but not type 3
  • (C) is type 1 but not type 2
  • (D) is type 0 but not type 1
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. What is the output of print 0.1 + 0.2 == 0.3?

Q. The value of acknowledgement field in a segment defines _______

Q. Which of the following is a not a characteristics of combinational circuits?

Q. Which of the following is correct for decisions made at life cycle level?

Q. Suppose that P(n) is a propositional function. Determine for which positive integers n the statement P(n) must be true if: P(1) and P(2) is true; for

Q. In associative mapping during LRU, the counter of the new block is set to ‘0’ and all the others are incremented by one, when o

Q. Which of the following methods can not achieve zero training error on any linearly separable dataset?

Q. Allowing multiple instructions for issuing in a clock cycle, is the goal of

Q. The number and size of tasks into which a problem is decomposed determines the __

Q. Every mathematical model

Question analytics