1 votes 1 votes closed with the note: resolved I can use 4 state dfa for no. of a should be divisible by 4 then minimum = 4 , or we have to construct dfa with 8 states ?? sumit goyal 1 asked Jan 9, 2018 closed Jan 9, 2018 by joshi_nitish sumit goyal 1 774 views comment Share Follow See 1 comment See all 1 1 comment reply sumit goyal 1 commented Jan 9, 2018 reply Follow Share i think 8 will be answer because dfa should not accept the sequesnce which is not in language like aaaa is not in language but aaaa is accepted by dfa so we will go for 8 states right ? 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes I think it must be required 8 states because Language L accept minimum string length 8, but not 4 . thepeeyoosh answered Jan 9, 2018 thepeeyoosh comment Share Follow See 1 comment See all 1 1 comment reply sumit goyal 1 commented Jan 9, 2018 reply Follow Share haa it should not accept aaaa because our language dont contain aaaa but if we make dfa in which no. of a divisible by 4 dfa accept it and hence not 4 states 8 states is minimum 1 votes 1 votes Please log in or register to add a comment.