UTpaper

Free mock tests & test series

Question 189Asked in CIL MT Systems, 24 Aug 2026 (3:00 PM, CBT-26)

The minimized Deterministic Finite State Machine (DFSM) in theory of computation for a language always has:

  1. AExactly one final state
  2. BEqual number of final and non-final states
  3. CThe same number of states as the NFA
  4. DThe minimum number of states possible for that language
Show answerHide answer

Correct answer: (D) The minimum number of states possible for that language

From CIL MT Systems PYQ, 24 Aug 2026 (3:00 PM, CBT-26)

This is question 189 of CIL MT Systems PYQ, 24 Aug 2026 (3:00 PM, CBT-26). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.