#### RGPV 2006

Q. Give DFA accepting the language over alphabet {0,1} such that all strings of 0 and 1 ending in 101.

Ans. Some example strings = {101, 10101, 01101, 00101, 111o1, 1101}

Regular expression = (0+1)*101

Minimum number of states required = 4