Register

how many final states in minimal dfa that is not divisible by 3

217 views

2 Answers

0 votes
0 votes

Divisible by 'n' then no of states =n

No of final states =1 and non final states=n-1

So n-1=3-1=2 non final states 

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

14 votes
14 votes
5 answers
1
Vikrant Singh asked Feb 1, 2015
4,447 views
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?
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
User Avatar
1 votes
1 votes
1 answer
2
kislaya Pant asked May 8, 2018
1,163 views
Minimal Final States in DFA
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4).
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4)....
User Avatar
Link Copied!