Problem Detail: Tomorrow is my presentation and I want to clear my concepts… I’ve read that in DFA, “For each state, transition on all possible symbols (alphabet) should be defined.” Is for each state, defining transition on all possible symbols mandatory in DFA? If its not, then please give any examples?
Asked By : HQuser
Answered By : Yuval Filmus
A DFA is specified by the following data:
- An alphabet $Sigma$.
- A set of states $Q$.
- An initial state $q_0 in Q$.
- A set of final states $F subseteq Q$.
- A transition function $deltacolon Q times Sigma to Q$.
As you can see from the signature of $delta$, it specifies a transition at every state for every symbol.
Best Answer from StackOverflow
Question Source : http://cs.stackexchange.com/questions/66368
