Question

Design a Turing Machine that increments a binary number which is

  1. on the input tape.
03 Nov 2017
Answer :
Word Count : 297

Design a Turing Machine that increments a binary number which is

on the input tape.

The binary increment function adds one to a binary number. The x state takes us to the rightmost digit, then we switch to the i state - if a zero is read then we change it to 1, if a 1 is read we change it to a 0 and "carry one", (move left and repeat). Be sure to test your machine on the input 111.

 

Examples of binary increment:

 

1001 -> 1010

 

111-> 1000

 

The x state requires three different clauses.

 

 

 

R: Move one

______ _____ ___ _____ _______ _________ _____.
___ __________ ______ _____ _________.
______ _________ ________ __________ ____ ______ ____ _______ ________ ______.
_____ _________ __________ _____ _____.
_____ _________ ________ _______ ____ ________ ___ __________ _________ ____ ________.
____ _____ ____ ______ __________ ________ ______.
__________ _________ _______ ___ ________ __________ _________.
__________ ___ ____ _______ ________ ___ _______ ____ _________.
__________ _________ _________ ______ ______ ____ __________.
____ __________ ______ ______ ____ ____ ______ ____ _________ _______ _______ _____.
________ ______ ____ _______ ___ _________ ____ _________ ____.
___ ______ _____ __________ _____ ______ __________ _________ ______ ____.
_________ __________ __________ __________ __________ ____.
_________ _________ __________ ________ _______ _____ _____ ____ ___ ___ _________ _______.
_______ ___ ________ _________ ___.
_____ ________ __________ _________ ______ ____ _____ ________.
____ _____ ________ _______ ______ _________ ____ ________ ___ ___.
________ ________ ________ _______ ______.
__________ __________ __________ ____ __________ __________ _________ ______ ___ ______.
___ _______ ___ _____ _______ _____.
___ _________ ___ _______ _______ _________ _______ __________ ____ _____ ____ ____.
___ _________ __________ ___ ________ ______ _______.
___ _____ ________ __________ ______ ________ __________ __________ _______ ________.
IGNOU ACADEMY
Your IGNOU journey, made easier.
  • Solved Assignments
  • Study Notes
  • Guess Papers
  • Question Papers
Skip in 10
Top
📞
Call Support Instant phone assistance IGNOU MCS 31 2011 - Design a Turing Machine that increments a binary number which is | IGNOU Academy
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→