DFA Processing Strings MCQ

Test your knowledge with important DFA Processing Strings MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more DFA Processing Strings MCQs at Bissoy

• δ(A,1) = B, δ(A,0) =A Δ (B, (0,1)) =C δ(C,0) = A (Initial state =A) String=”011001” is transit at which of the states?
  ক

  A

  খ

  C

  গ

  B

  ঘ

  Invalid String
• For the DFA given below compute the following: Union of all possible combinations at state 7,8 and 9.
  ক

  {aba, ac, cc, ca, cb, bc, bab, ca}

  খ

  {bab, bc, ac, aba, ca, aac, ccb}

  গ

  {cc, ca, cb, aba, bab, ac}

  ঘ

  {aba, ac, cc, ca, cb, bc, bab, caa}
• For a machine to surpass all the letters of alphabet excluding vowels, how many number of states in DFA would be required?
  ক

  3

  খ

  2

  গ

  22

  ঘ

  27
• Let the given DFA consist of x states. Find x-y such that y is the number of states on minimization of DFA?
  ক

  3

  খ

  2

  গ

  1

  ঘ

  4
• Which of the following is the corresponding Language to the given DFA?
  ক

  L = {x ϵ {0, 1} * | x ends in 1 and does not contain substring 01}

  খ

  L = {x ϵ {0,1} * |x ends in 1 and does not contain substring 00}

  গ

  L = {x ϵ {0,1} |x ends in 1 and does not contain substring 00}

  ঘ

  L = {x ϵ {0,1} * |x ends in 1 and does not contain substring 11}
• The password to the admins account=”administrator”. The total number of states required to make a password-pass system using DFA would be __________
  ক

  14 states

  খ

  13 states

  গ

  12 states

  ঘ

  A password pass system cannot be created using DFA