Q2.8

MCQ2 marks, −0.5

What can be said about a regular language $L$ over $\{ a \}$ whose minimal finite state automaton has two states?

(A)

$L$ must be $\{a^n \mid n \ \text{ is odd}\}$

(B)

$L$ must be $\{a^n \mid n \ \text{ is even}\}$

(C)

$L$ must be $\{a^n \mid n \geq 0\}$

(D)

Either $L$ must be $\{a^n \mid n \text{ is odd}\}$ , or $L$ must be $\{a^n \mid n \text{ is even}\}$

Loading…