The NFA with n-moves to the DFA MCQ

Test your knowledge with important The NFA with n-moves to the DFA MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30+ more The NFA with n-moves to the DFA MCQs on Bissoy. Bissoy App

• For the following grammar: S → A | B | 2 A → C0 | D B → C1 | E C → D | E | 3 D → E0 | S E → D1 | S Identify all the unit pairs.
  ক

  D,C

  খ

  A,B

  গ

  B,C

  ঘ

  A,C
• The grammar G: S → SS | a | b is ambiguous. Check all and only the strings that have exactly two leftmost derivations in G.
  ক

  bbb

  খ

  ab

  গ

  All of the mentioned

  ঘ

  None of the mentioned
• The parse tree below represents a rightmost derivation according to the grammar S → AB, A → aS|a, B → bA. Which of the following are right-sentential forms corresponding to this derivation?
  ক

  aAbAba

  খ

  aababa

  গ

  aABba

  ঘ

  aSba
• Here is a context-free grammar G: S → AB A → 0A1 | 2 B → 1B | 3A which of the following strings are in L (G)?
  ক

  021300211

  খ

  022111300211

  গ

  None of the mentioned

  ঘ

  021300211 & 022111300211
• If is a language, and is a symbol, then, the quotient of and, is the set of strings such that is in: is in. Suppose is regular, which of the following statements is true?
  ক

  L/a is always a regular language

  খ

  L/a is not a regular language

  গ

  All of the mentioned

  ঘ

  None of the mentioned
• Which grammar is not regular?
  ক

  0^n

  খ

  0^n 1^n n

  গ

  0^m 0^n n

  ঘ

  0^n 0^n n
• Find the pair of regular expressions that are equivalent.
  ক

  (0+1)* and (0*+1*)*

  খ

  (0+1)* and (0+1*)*

  গ

  (0+10)* and (0*+10)*

  ঘ

  All of the mentioned
• If string s is accepted by this DFA, which of these strings cannot be suffix of s?
  ক

  111001

  খ

  111111

  গ

  111000

  ঘ

  101010
• Examine the following DFA: If input is 011100101, which edge is NOT traversed?
  ক

  A B

  খ

  C

  গ

  C D

  ঘ

  D A