I searched google and in many pages it is given that in Minimized DFA dead state or trap state is removed. My question is how can it be still a DFA if some transition is undefined. So what you say people?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I searched google and in many pages it is given that in Minimized DFA dead state or trap state is removed. My question is how can it be still a DFA if some transition is undefined. So what you say people?
Even minimal DFAs must include dead states; otherwise, they’re either (a) not DFAs or (b) not accepting the same language as their non-minimal counterparts. For instance, a minimal DFA for the language {a} over alphabet {a, b} must have 3 states: a start state where you can see a and accept; an accepting state where you reject if you see anything else; and a dead state where you go if you see a b or anything in the accepting state.
Never heard of omitting dead states from minimal DFAs. Blasphemy!