Construct a Turing Machine that computes the expression 2x+y, where x, y 2 0, and are represented on the tape as a sequence of 1s separated by a 0. For e. g., Say, x = 3, y = 5 are represented on the screen as -111011111; At the end of the computation, the tape contents should be -11111111111 representing the number 2x+y = 2(3)+5 = 11. Solution hint: a. If x = 0 and y 0, Accept. b. If x = 0, then 2x+y = y, Accept. C. Replace 1s of x with A. d. For each A, replace A with 1, and add a 1 at the end of the tape contents. e. Finally, Move 0 to the end f tape contents, and replace with a Blank, and Accept.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Construct a Turing Machine that computes the expression 2x+y, where x, y 2
0, and are represented on the tape as a sequence of 1s separated by a 0. For e. g., Say, x = 3, y =
5 are represented on the screen as -111011111; At the end of the computation, the tape
contents should be +11111111111 representing the number 2x+y = 2(3)+5 = 11.
Solution hint:
a. If x = 0 and y = 0, Accept.
b. If x = 0, then 2x+y = y, Accept.
c. Replace 1s of x with A.
d. For each A, replace A with 1, and add a 1 at the end of the tape contents.
e. Finally, Move 0 to the end f tape contents, and replace with a Blank, and Accept.
Transcribed Image Text:Construct a Turing Machine that computes the expression 2x+y, where x, y 2 0, and are represented on the tape as a sequence of 1s separated by a 0. For e. g., Say, x = 3, y = 5 are represented on the screen as -111011111; At the end of the computation, the tape contents should be +11111111111 representing the number 2x+y = 2(3)+5 = 11. Solution hint: a. If x = 0 and y = 0, Accept. b. If x = 0, then 2x+y = y, Accept. c. Replace 1s of x with A. d. For each A, replace A with 1, and add a 1 at the end of the tape contents. e. Finally, Move 0 to the end f tape contents, and replace with a Blank, and Accept.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY