Question
In an automata or formal-language problem, which option best represents DFA transition function?
Select an option. Your answer will be checked instantly.
Correct Answer: C. a function mapping a state and input symbol to exactly one next state
Explanation:
In this course context, DFA transition function means a function mapping a state and input symbol to exactly one next state.
Leave a Reply