Question

The maximum number of transitions which can be performed over a state in a DFA? \( \Sigma = \{a, b, c\} \)

• A. 8
• B. 2
• C. 3
• D. 7

Hint:

In DFAs, each state has exactly one outgoing transition for each symbol in the alphabet.

Answer 1

The Correct Option is C

In a DFA, each state must have exactly one transition for each symbol in the alphabet. Since the alphabet \( \Sigma = \{a, b, c\} \) contains 3 symbols, the maximum number of transitions that can be performed from any state is 3, one for each symbol.