366 views
0 votes
0 votes

For a binary string x = a0a1 · · · an−1 define val(x) to be the value of x interpreted as a binary number, where a0 is the most significant bit. More formally, val(x) is given by
How many minimum states will be in a finite automaton that accepts exactly the set of binary strings x such that val(x) is divisible by either 4 or 5.

Ans is 5 or 20?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
suraj patel asked Jul 10, 2018
2,518 views
Construct the Minimum FA that accepts all the string of 0's and 1's whereA)Every String start and end with Zero.B)Every string Start and end with Same Symbol.
2 votes
2 votes
1 answer
3
rahul sharma 5 asked Nov 9, 2017
938 views
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
1 votes
1 votes
0 answers
4