Question
What is meant by DFA transition function in Theory of Automata and Formal Languages?
Correct Answer: D
a function mapping a state and input symbol to exactly one next state
The correct answer is a function mapping a state and input symbol to exactly one next state.
The correct answer is a function mapping a state and input symbol to exactly one next state.
Leave a Reply