Consider the n-bit binary representation of a natural number x: the binary repre
ID: 3884765 • Letter: C
Question
Consider the n-bit binary representation of a natural number x: the binary representation of is (a_n-1 x_n-2 x_1x_0)_2 doubleheadarrow x = sigam^n-1_i=0 x_i 2^i where each bit x_i is a binary digit, either zero or one. For example, (00000101)_2 is the 8-bit binary representation of the number 5, since 0.2^7 _ 0.2^5_0.2^4 + 0.2^3 + 1.2^2 + 0.2^1 + 1.2^0 = 4 +1 - 5. This is the format normally employed by digital computers to store nonnegative integers. Consider the language L = {a_0b_0c_0 a_n-1b_n-1c_n-1: n elementof N Forall i, 0 lessthanorequalto iExplanation / Answer
A DFA can be defined by : M1 = (Q, , , q0, F)
where:
Q = {A, B, C, D, E, F, G, H, I}
= {0,1}
= transition function
q0 = A {starting point is A)
F = {D} {D is the acceptance state}
I tried pasting the image which i prepared on my book but it seems there is some problem with image uploading for now.... Just try to prepare the diagram with table, it'll not take more then a min....
State Input-0 (binary 0) Input-1 (binary 1) A B F B C E C D Not Acceptable D B F E Not Acceptable D F E G G H No Acceptable H I F I E G