Turing Machine Design a Turing Machine (M1) that takes any string as input (except the empty string), and shifts each character of the string one place into the right. For instance, if the tape initially contains the following [a|b|a|␣|␣], then it should contain the following after M1 halts [#|a|b|a|␣]. You may assume that M1 always halts and accepts except when the tape does not contain anything. Assume the input alphabet Σ is {a, b} and the tape alphabet Γ is Σ ∪ {#, a, b, ␣}.   a)(30 points) Draw the state diagram for M1.     b)(20 points) Provide the formal definition for M1.   C)(25 points) Describe what M1 does in numbered stages (as an algorithm).       d) (25 points) Modify M1 to make it shift the tape content by two characters instead of one (e.g., the tape content in the previous example should be [#|#|a|b|a|␣]). Redraw the new version of M1.

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
icon
Related questions
Question

Turing Machine

Design a Turing Machine (M1) that takes any string as input (except the empty string), and shifts each character of the string one place into the right. For instance, if the tape initially contains the following [a|b|a|␣|], then it should contain the following after M1 halts [#|a|b|a|]. You may assume that M1 always halts and accepts except when the tape does not contain anything.

Assume the input alphabet Σ is {a, b} and the tape alphabet Γ is Σ ∪ {#, a, b, ␣}.

 

a)(30 points) Draw the state diagram for M1.

 

 

b)(20 points) Provide the formal definition for M1.

 

C)(25 points) Describe what M1 does in numbered stages (as an algorithm).  

 

 

d) (25 points) Modify M1 to make it shift the tape content by two characters instead of one (e.g., the tape content in the previous example should be [#|#|a|b|a|␣]). Redraw the new version of M1.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 4 images

Blurred answer
Knowledge Booster
Problems on Turing Machines
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education