Extended Transition Function MCQ

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

• Number of times the state q3 or q2 is being a part of extended 6 transition state is
  ক

  6

  খ

  5

  গ

  4

  ঘ

  7
• According to the given table, compute the number of transitions with 1 as its symbol but not 0:
  ক

  4

  খ

  3

  গ

  2

  ঘ

  1
• If a string S is accepted by a finite state automaton, S=s1s2s3……sn where siϵ∑ and there exists a sequence of states r0, r1, r2…… rn such that δ(r(i), si+1) =ri+1 for each 0, 1, …n-1, then r(n) is:
  ক

  initial state

  খ

  transition symbol

  গ

  accepting state

  ঘ

  intermediate state
• What is the relation between DFA and NFA on the basis of computational power?
  ক

  DFA > NFA

  খ

  NFA > DFA

  গ

  Equal

  ঘ

  Can’t be said
• If δ is the transition function for a given NFA, then we define the δ’ for the DFA accepting the same language would be: Note: S is a subset of Q and a is a symbol.
  ক

  δ’ (S, ] =Upϵs δ (p, ] =Up≠s δ (p, ] c) δ’ (S, ] =Upϵs δ(p) d) δ’ (S) =Up≠s δ(p) View Answer]

  খ

  δ’ (S, a) =Up≠s δ (p, a)

  গ

  δ’ (S, a) =Upϵs δ(p)

  ঘ

  δ’ (S) =Up≠s δ(p)
• The number of tuples in an extended Non Deterministic Finite Automaton:
  ক

  5

  খ

  6

  গ

  7

  ঘ

  4