Register

TOC minimal DFA

1,945 views

2 Answers

3 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 0 votes

min. four state is required

• edited by
Voting & Accepting an answer helps improve the community
← Previous · MadeEasy Test Series...Next → · TOC how many strings
← Previous in category · General TOC decidabl...Next in category → · TOC how many strings
Position:
Show:

Related questions

1 1 vote
3 answers 3 answers
1.8k
1.8k views
rahul sharma 5 asked Aug 6, 2017
1,751 views
TOC Minimal DFA design
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 0 votes
0 0 answers
591
591 views
ankit-saha asked Mar 24, 2022
591 views
Minimal DFA
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 0 votes
2 answers 2 answers
2.8k
2.8k views
aditi19 asked Dec 14, 2018
2,810 views
Minimal DFA
Given following NFAfind the minimal equivalent DFA
1 1 vote
1 answers 1 answer
4.1k
4.1k views
sripo asked Nov 6, 2018
4,097 views
What is the minimal DFA for this language (11+111)*, for Σ={0,1}.
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?