M

Mr. Dubey • 100.69K Points
Coach

Q. The regular grammar for the language L = {anbm | n + m is even} is given by

  • (A) S → S1 | S2 S1 → a S1| A1 A1 → b A1| λ S2 → aaS2| A2 A2 → b A2| λ
  • (B) S → S1 | S2 S1 → a S1| aA1 S2 → aaS2| A2 A1 → b A1| λ A2 → b A2| λ
  • (C) S → S1 | S2 S1 → aaa S1| aA1 S2 → aaS2| A2 A1 → b A1| λ A2 → b A2| λ
  • (D) S → S1 | S2 S1 → aa S1| A1 S2 → aaS2| A2 A1 → bb A1| λ A2 → bb A2| λ
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 address system supported by ARM systems is/are ___________

Q. IEEE standard for SRS is:

Q. Hamilton cycle is a cycle that contains every ________of G.

Q. If there is only a discrete number of possible outcomes called _____.

Q. Shannon Defined A Quantity Called

Q. A relation is said to be in BCNF when

Q. If the instruction Add R1, R2, R3 is executed in a system which is pipelined, then the value of S is (Where S is a term of the Basic performance equat

Q. Mobile Service Design consists of which of the following type ?

Q. Which command is used to remove a file ……

Q. #define t 10 void main() { printf("%d",t); }

Question analytics