495 views
0 votes
0 votes
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.

Please log in or register to answer this question.

Related questions

2 votes
2 votes
1 answer
1
Hirak asked May 22, 2019
1,031 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$ × ...
0 votes
0 votes
1 answer
2
Niranjan kumar asked Apr 25, 2017
399 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
0 votes
0 votes
0 answers
3
adviddya asked Apr 18, 2017
269 views
draw all possible binary tree using three nodes
1 votes
1 votes
1 answer
4
kalpish asked Apr 8, 2015
1,063 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 ...