edited by
4,948 views
3 votes
3 votes
No of states in finite automata whose string length is divisible by 3 or8?
edited by

1 Answer

Best answer
5 votes
5 votes

$\sum= \left \{ a,b \right \}$

Number of states in deterministic finite automata whose string length is divisible by 3 or 8 = 24 states.

selected by

Related questions

14 votes
14 votes
5 answers
1
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
0 votes
0 votes
3 answers
4