search
Log In
3 votes
105 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?
in Theory of Computation 105 views

1 Answer

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
0
Explanation please?
0
what efforts did you put in?

Or any specific thing which you aren't able to understand about this dfa?
0
How prefix is having difference confused about that.
0

@ AskHerOut

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

0 votes
1 answer
1
317 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 )$
asked Jul 15, 2019 in Theory of Computation ajaysoni1924 317 views
0 votes
2 answers
3
196 views
Intersection of Recursive and Recursively Enumerable language is____________________ ?
asked Jun 2, 2019 in Theory of Computation Hirak 196 views
0 votes
1 answer
4
125 views
is union of regular language and context free language always regular?
asked May 22, 2019 in Theory of Computation Hirak 125 views
...