Language acceptance by Deterministic Finite Automata (DFAs)
Which among the following is not required to describe a DFA?
What is the input to a transition function?
What is the output of a transition function?
Can a DFA be described using a transition table?