0 0 votes The machine pictured in fig a)complements a given bit pattern b)finds 2's complement c)increments a given bit pattern by 1 d)changes the sign bit Theory of Computation + – Sanjay Sharma 1.3k views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply Show 2 previous comments dd commented Apr 15, 2017 reply Follow flag feed a bit string from LSB and this machine will increment the bit pattern by $1$. 0 0 replyShare Prashant. commented Apr 15, 2017 reply Follow flag But for 11111 it will lost MSB bit na. output wil be 00000 instead of 100000 0 0 replyShare dd commented Apr 15, 2017 i edited by dd Apr 15, 2017 reply Follow flag Apart from overflow case : it works fine. To handle all set bit string, we can pad extra zeros always before MSB to get the desired output from the machine. 1 1 replyShare Please log in or register to add a comment.
Best answer 3 3 votes Example: $001101$ : feed this string from LSB : output = $001110$ $110010$ : feed this string from LSB : output = $110011$ c) Increments a given bit pattern by $1$ dd answered Apr 15, 2017 • selected Jul 8, 2017 by dd dd comment Share Follow See all 2 Comments 2 2 Comments reply Kapil commented Apr 15, 2017 reply Follow flag But, that condition should be mentioned, right ? From where to feed :)) Also, where is the final state ? 0 0 replyShare Prashant. commented Apr 15, 2017 reply Follow flag No need of final state in Melay and Moorey. 2 2 replyShare Please log in or register to add a comment.