3 votes 3 votes create a dfa with odd occurrence of sub string "abb" .and short cut for finding no.of states Theory of Computation of theory-of-computation + – all mix asked Jan 29, 2018 • edited Mar 12, 2018 by sumit goyal 1 all mix 808 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply hs_yadav commented Jan 29, 2018 reply Follow Share i think it needs minimum 7 state....? 0 votes 0 votes all mix commented Jan 29, 2018 reply Follow Share can u explain it.plz 0 votes 0 votes sumit goyal 1 commented Jan 29, 2018 reply Follow Share minimum no. of states required = 6 @all mix what is answer given btw 0 votes 0 votes all mix commented Jan 29, 2018 reply Follow Share i think it should be 6...i do not have answer 0 votes 0 votes sumit goyal 1 commented Jan 29, 2018 reply Follow Share there is as of now no shortcut to find minimum no. of states required Thank you ! 0 votes 0 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes 6 will be answer sumit goyal 1 answered Jan 29, 2018 • selected Jan 29, 2018 by joshi_nitish sumit goyal 1 comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments sumit goyal 1 commented Jan 29, 2018 reply Follow Share joshi_nitish can you tell any string in which dfa fails 0 votes 0 votes joshi_nitish commented Jan 29, 2018 reply Follow Share your DFA is not accepting $abbabab$, which is in language 0 votes 0 votes sumit goyal 1 commented Jan 29, 2018 reply Follow Share edited thanks for pointing mistake 0 votes 0 votes Please log in or register to add a comment.