Answered: Design and implement a Turing Machine…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

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

Machine Description
Similarly, there are several possible ways of describing a TM. Examples:
state transition table
diagram
1. ((S0,0)(0,s0,R))
2. ((S0,1)(1,S0,R))
3. ((S0,#)(#,S1,R))
4. ((S1,1)(0,S1,L))
1:1
#:1
1:0
R
#:#→L
H
2
0:1
5. ((S1,#)(1,S2,L))
6. ((S1,0)(1,S2,L))
0:0
We'll use both of these.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions