question

Question

Consider 2 scenarios:
C1: For DFA (ϕ, Ʃ, δ, qo, F),
if F = ϕ, then L = Ʃ*
C2: For NFA (ϕ, Ʃ, δ, qo, F),
if F = ϕ, then L = Ʃ*
Where F = Final states set
ϕ = Total states set
(a) Both are true                                (b) Both are False
(c) C1 is true, C2 is false                    (d) C1 is false, C2 is true

Comments

C1 is true C2 is false

---

If all states are final states in DFA it accept complete language.

If all states are final states in NFA while convert into DFA dead state may possible.So it may not accept complete language.

Hence C1 is true and C2 is false.

Answer 1

The answer is option C.

Reason: In DFA there's a transition from each and every state for every input symbol. Since its given that all states are final states for the DFA then it will accept $\sum$*

But in NFA its not necessary that we draw each and every state and show transition foreach of its input symbol. In that case it might not accept all the possible strings.