387 views
3 votes
3 votes
let L be a set of binary string whose integer equivalent is congruent to 10 (mod 16) Then minimal DFA that accept L contains how many states ? plz explain

1 Answer

Best answer
1 votes
1 votes

10 mod 16 = 10. Congruent to 10 means those numbers, which when divided by 16 give a remainder 10 ( i.e. 10 mod 16)

Consider the following numbers congruent to 10 mod 16 and their binary equivalents

10 1010
26 11010
42 101010
58 111010
90 1011010
1898 11101101010

All these numbers end with 010...keeping this mind, construct the DFA.

Hence, the number of states will be 5.

selected by

Related questions

1 votes
1 votes
1 answer
1
Anil Ji asked Aug 5, 2018
460 views
The height h of an AVL tree with n nodes lies in the interval:1.log2(n+1) ≤ h < c log2(n+2)+b 2.log10(n) ≤ h < c log10(n+1)+b 3.log10(n+1) ≤ h < c log10(n+2)+b 4.lo...
0 votes
0 votes
0 answers
2
2 votes
2 votes
2 answers
3
2 votes
2 votes
1 answer
4
himgta asked Apr 21, 2018
317 views
Find the output of the c program below, assume base address of the array is 1500. The size of int is 4 bytes