1,162 views
0 votes
0 votes
Find a DFA for the following language on Σ = {0, 1}

L = {w : the value of w, interpreted as a binary representation of an integer is zero modulo five}. For example, 0101 and 1111, representing the integers 5 and 15, respectively, are to be accepted. Hint: Label the states with the value (mod 5) of the partial bit string. To take care of the next bit, use the relationship 2n mod 5 = (2n mod 5) mod 5, (2n + 1) mod 5 = [(2n mod 5) + 1] mod 5.

1 Answer

Best answer
0 votes
0 votes

......

edited by

Related questions

0 votes
0 votes
1 answer
2
shekhar chauhan asked Jun 8, 2016
951 views
Write a Grammar which is a not type -3 Grammar, from the Language L over alphabets {a ,b} which contains ab as a Sub-string. Explain the procedure with Example .
0 votes
0 votes
1 answer
3
M_Umair_Khan42900 asked Dec 29, 2022
743 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...