closed by
774 views
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 ??
closed by

1 Answer

2 votes
2 votes
I think it must be required 8 states because Language L accept minimum string length 8, but not 4 .

Related questions

14 votes
14 votes
5 answers
2
Vikrant Singh asked Feb 1, 2015
4,292 views
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?A. 5B. 6C 31D 32
2 votes
2 votes
2 answers
3
worst_engineer asked Jan 14, 2016
539 views
Which of the following represent the minimum no. of states in DFA which accept all string of length atmost 5 ‘a’?6457Answer given in 5 , how possible ?atmost ...
3 votes
3 votes
1 answer
4
Vinil asked Sep 16, 2017
4,948 views
No of states in finite automata whose string length is divisible by 3 or8?