Q53

MCQ2 marks, −0.5

Consider the machine $M$ :

The language recognized by $M$ is:

(A)

$\left\{ w \in \{a, b\}^* \text{ | every a in$ w $is followed by exactly two$ b $’s} \right\}$

(B)

$\left\{w \in \{a, b\}^* \text{ | every a in$ w $is followed by at least two$ b $’s} \right\}$

(C)

$\left\{w \in \{a, b\}^* \text{ |$ w $contains the substring ‘$ abb $’} \right\}$

(D)

$\left\{w \in \{a, b\}^* \text{ |$ w $does not contain ‘$ aa $’ as a substring} \right\}$

Loading…