Is dead state included in Minimum DFA

Question

Here minimum no. of states 4 or 5(including dead state)

Comments

How to decide Minimum DFA has these no. of states for a language L

---

it takes practise.

normal method :-

draw an nfa for given language => convert it to dfa => do the minimization of dfa.=> states in minimum dfa is the answer.

Answer 1

If dead state is removed from dfa,it would result in nfa. Because in dfa we need to show path for each input from every state.

Comments

u mean minimum dfa has 5 states

---

Yes.Exactly.

---

It's mean that nfa has no dead state

---

no.

Answer 2

Ur minimum DFA only has four states. The Dead state is not included. Coz here all those strings which r not accepted in DFA r included. Yeah. :)

Comments

https://en.wikiversity.org/wiki/Automata_theory/Finite_automata. 

Read d above link for more information. Yeah. I Hope d descp Helps u. :)

---

Yes, dead state will be included in minimum no of states in dfa.

for reference check set 2 2017 question on same.

secondly, above fa is not a dfa as per definition of dfa.

---

@Praveen Sir, Can you please support ur comment with an answer. It'll be a great help indeed if Dead state is included in d minimum no of states of DFA. Indeed a big Help. Thanks again in advance Sir. :)

---

Sir why above FA is not DFA

---

@student2018, dead configuration are not allowed in DFA.

Every state must have one transition for every symbol.

Answer 3

dead state is included in DFA. Total 5 states in minimal dfa