Q40

MCQ2 marks, −0.67

Consider the following deterministic finite automaton (DFA) defined over the alphabet, $\Sigma=\{a, b\}$ . Identify which of the following language(s) is/are accepted by the given DFA.

(A)

The set of all strings containing an even number of $b$ 's.

(B)

The set of all strings containing the pattern $b a b$ .

(C)

The set of all strings ending with the pattern $b a b$ .

(D)

The set of all strings not containing the pattern $a b a$ .

Loading…