in Theory of Computation
410 views
3 votes
3 votes
Design a dfa in which accepts all the strings in which every prefix the difference of 0 and 1 is not more than 2?
in Theory of Computation
410 views

1 Answer

0 votes
0 votes

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 by

4 Comments

How prefix is having difference confused about that.
0
0

@ AskHerOut

how u r giving 02

it will be only 0 and 1 ,as they told

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

Related questions