Question

Consider the following language :

$L=\{wϵ{\{0,1\}}^{\ast }\mid wendswiththesubstring0110\}$

Which one of the following deterministic finite automata accepts L?

• A.
• B.
• C.
• D.

Answer 1

The correct option is A

Since 4 states are required in minimal DFA for this language "Ending with 011", and since all given DFA's have 4 states, the answer must be same as minimal DFA.

The minimal DFA for this language is given below:

Which is same as option (a).