Register

below are images showing two minimal dfa accepting binary string divisible by 2 my question is which one is right.

759 views
0 votes
0 votes

User Avatar

Please log in or register to answer this question.

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

Related questions

1 votes
1 votes
1 answer
1
Parth Sharma asked Jan 28, 2017
871 views
draw DFA of all string whose binary interpretation are divisible by 5
draw DFA of all string whose binary interpretation are divisible by 5
draw DFA of all string whose binary interpretation are divisible by 5
User Avatar
14 votes
14 votes
5 answers
3
Vikrant Singh asked Feb 1, 2015
4,382 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
0 votes
0 votes
1 answer
4
KingSAJ asked Jan 19, 2015
825 views
The number of states in a DFA accepting all the strings over {0,1} in which 5th symbol from right hand side is always '1' is?
Will the answer be $4$ or $2^5$?
User Avatar
Link Copied!