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? Theory of Computation theory-of-computation + – Kuldeep Pal asked Oct 22, 2017 Kuldeep Pal 409 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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 :) AskHerOut answered Oct 22, 2017 • edited Oct 22, 2017 by AskHerOut AskHerOut comment Share Follow See all 5 Comments See all 5 5 Comments reply Kuldeep Pal commented Oct 22, 2017 reply Follow Share Explanation please? 0 votes 0 votes AskHerOut commented Oct 22, 2017 reply Follow Share what efforts did you put in? Or any specific thing which you aren't able to understand about this dfa? 0 votes 0 votes Kuldeep Pal commented Oct 22, 2017 reply Follow Share How prefix is having difference confused about that. 0 votes 0 votes srestha commented Oct 22, 2017 reply Follow Share @ AskHerOut how u r giving 02 it will be only 0 and 1 ,as they told 0 votes 0 votes AskHerOut commented Oct 22, 2017 reply Follow Share That's just a name of the state arbitrarily chosen( Although slightly makes sense to me). 0 votes 0 votes Please log in or register to add a comment.
