DRDO CSE 2022 Paper 2 | Question: 10

Question

Construct a Deterministic Finite Automaton $\text{(DFA)}$ with $5$ states that accepts all strings with $0101$ as a substring.

Answer 1

Accepts all the strings with substring $0101$, the regular expression will be:

$R=(0+1)^*0101(0+1)^*$

The DFA is as follows: