# Self doubt

104 views
Design a dfa in which accepts all the strings in which every prefix the difference of 0 and 1 is not more than 2?

EDIT: put a=1 and b=0 as this question asks for 0 and 1 (I have, mistakenly drawn for a's and b's).

All the best.

Happy to help :)

edited
0
0
what efforts did you put in?

0
How prefix is having difference confused about that.
0

how u r giving 02

it will be only 0 and 1 ,as they told

0
That's just a name of the state arbitrarily chosen( Although slightly makes sense to me).

## Related questions

1
314 views
$L=\left \{< M_{1},M_{2}> \text{such that L}(M_{1})\prec L(M_{2}) \right \}$ is it recursive enumerable? here $L\left ( M_{1} \right )\prec L\left ( M_{2} \right )$ signifies language $L\left ( M_{1} \right )$ is reducible to $L\left ( M_{2} \right )$
1 vote