1,285 views

2 Answers

3 votes
3 votes

Set of binary strings which is divisible by n can be formed by DFA having n states.

So, 8 states. But we can minimize it to 4 states.

edited by
0 votes
0 votes

min. four state is required

edited by

Related questions

1 votes
1 votes
3 answers
1
rahul sharma 5 asked Aug 6, 2017
862 views
Let language defined is { Number of a's =2 and length of string is atleast 3} over alphabet {a,b}.What are number of states in minimal DFA?
0 votes
0 votes
0 answers
2
ankit-saha asked Mar 24, 2022
338 views
What will be the minimal DFA for $\left \{a^{n} :n mod 3 =0 \right \}\cup \left \{a^{n} :n mod 5 =1 \right \}$
0 votes
0 votes
2 answers
3
aditi19 asked Dec 14, 2018
1,501 views
Given following NFAfind the minimal equivalent DFA
1 votes
1 votes
1 answer
4
sripo asked Nov 6, 2018
2,977 views
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?