search
Log In
0 votes
174 views
the minimal finite automata accepting the set of all strings over { 0, 1} starting with 1 that interpreted as the binary representation of an integer are congruent to 0 modulo 5 has  ______ states.
in Theory of Computation 174 views
0
7states.
0
It must be 7 states.

A minimal DFA which accepts strings divisible by 5 contains 5 states.

In the first production you have to add a dead state for transition on 0 and the first state would have transition 1 going to the next state and the rest is as usual for 0mod5.

Please log in or register to answer this question.

Related questions

2 votes
1 answer
1
199 views
Find the no. of DFA’s that can be constructed over the alphabet Σ with 5 symbols, and with 10 states. (a) $2^5$^0$ × $50^5$ (b) $2^1$^0$ × $10^5$^0$ (c) $2^5$ × $10^5$^0$ (d) $2^5$^0$ × $50^5$
asked May 22, 2019 in Theory of Computation Hirak 199 views
0 votes
1 answer
2
186 views
Torque exerted on a flywheel over a cycle is listed in the table .flywheel energy (in j per unit cycle) using simpson's rule is
asked Apr 25, 2017 in Mathematical Logic Niranjan kumar 186 views
0 votes
0 answers
3
76 views
draw all possible binary tree using three nodes
asked Apr 18, 2017 in Algorithms adviddya 76 views
1 vote
1 answer
4
410 views
At the end of it's 5th Successful season,The siruseri Permier league is planning to give an award to most improved bowler over 5 years . For this an important Index will be computed for each bowler,This is defined as the longest Subsequence of strictly decreasing economy rate's by the bowler among ... [1] What is the Time complexity in Dynamic programming ? a) O(n) b) O(nLog n) c) O(n2) d) O(n3)
asked Apr 8, 2015 in Algorithms kalpish 410 views
...