The Gateway to Computer Science Excellence
+3 votes
69 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 by Active (1.5k points) | 69 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 :)

by Junior (941 points)
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).
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,297 answers
198,265 comments
104,979 users