Design and implement a Turing Machine to perform the conversion of a binary number to Two's Complement, using the 'fast' method described in the class notes. Recall that the fast method starts at the LSB (to the right), leaves all 0's and the first 1 alone, then flips all the remaining bits. The tape will consist of a 'sign' bit (0 for positive, 1 for negative), a blank space, and then the number to convert. After conversion, the sign bit is removed. Here are some examples: INPUT : ... # 0 # 00100001 # ... OUTPUT: ... # # # 00100001 # ... INPUT : ... # 1 # 00101000 # ... OUTPUT: ... # # # 11011000 # ... Give the TM diagram, as well as the state transition table, using the notation described in the class notes and associated lab. You can find a sample in the picture. Thanks
Design and implement a Turing Machine to perform the conversion of a binary number to Two's Complement, using the 'fast' method described in the class notes. Recall that the fast method starts at the LSB (to the right), leaves all 0's and the first 1 alone, then flips all the remaining bits. The tape will consist of a 'sign' bit (0 for positive, 1 for negative), a blank space, and then the number to convert. After conversion, the sign bit is removed. Here are some examples:
INPUT : ... # 0 # 00100001 # ...
OUTPUT: ... # # # 00100001 # ...
INPUT : ... # 1 # 00101000 # ...
OUTPUT: ... # # # 11011000 # ...
Give the TM diagram, as well as the state transition table, using the notation described in the class notes and associated lab. You can find a sample in the picture. Thanks
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
