Home » MCQs » Theory of Computation MCQs

For specified input, there can be how many paths from the current state to the next state in DFA?

25. For specified input, there can be how many paths from the current state to the next state in DFA?

1. Many
2. None
3. One
4. Zero

Answer: C) One

Explanation:

For specified input, there is only one path from the current state to the next state in DFA.