M

Mr. Dubey • 100.69K Points
Coach

Q. S –> aSa| bSb| a| b ; The language generated by the above grammar over the alphabet {a,b} is the set of

  • (A) All palindromes.
  • (B) All odd length palindromes.
  • (C) Strings that begin and end with the same symbol
  • (D) All even length palindromes.
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. Consider the following problem x. Given a Turing machine M over the input alphabet Σ, any state q of M. And a word w Є Σ*, does the compu

Q. What is the time complexity of the brute force algorithm used to find the longest common subsequence?

Q. supports low energy radio operation.

Q. The event with minimum probability has least number of bits.

Q. What happens if the base condition isn’t defined in recursive programs?

Q. To allow only one user to work with a particular file at a particular time, one has to use

Q. The first firm to mass-market a microcomputer as a personal computer was

Q. Bellmann Ford Algorithm can be applied for

Q. Discrete events and agent-based models are usuallly used for .

Q. Independent Verification & Validation is

Question analytics