Q18

MCQ1 mark, −0.33

A regular language $L$ is accepted by a non-deterministic finite automaton (NFA) with $n$ states. Which of the following statement(s) is/are FALSE?

(A)

$L$ may have an accepting NFA with $< n$ states.

(B)

$L$ may have an accepting DFA with $<n$ states.

(C)

There exists a DFA with $\leq 2^{n}$ states that accepts $L$ .

(D)

Every DFA that accepts $L$ has $>2^{n}$ states.

Loading…