UTpaper

Free mock tests & test series

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

What makes a finite automaton deterministic?

  1. AIt can have multiple transitions for the same input
  2. BFor each state and input, there is exactly one transition
  3. CIt can accept infinite input
  4. DIt has no start state
Show answerHide answer

Correct answer: (B) For each state and input, there is exactly one transition

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

This is question 101 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.