The Gateway to Computer Science Excellence
+1 vote
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 ??
closed with the note: resolved
in Theory of Computation by Boss (10.5k points)
closed by | 94 views
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 ?

1 Answer

+2 votes
I think it must be required 8 states because Language L accept minimum string length 8, but not 4 .
by Active (2k points)
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
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,392 answers
105,444 users