Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
draw the state diagram of a Turing Machine that will compute x + y, where x and y are given in unary representation. Assume that the non-blank portion of the input tape consists of x occurrences of ones (to represent x) followed by a $ sign and then y occurrences of ones with an infinite number of blanks on both sides of the non-blank portion of the tape. The non-blank portion of the output of your Turing Machine is expected to be x ones followed by the $ sign followed by y ones followed by the # sign followed by x + y ones. For example, if x = 5 and y = 7, then your input tape will be 11111$1111111, which produces the output tape 11111$1111111#111111111111 (with blanks on both sides of the non-blank portion).

draw the state diagram of a Turing Machine that will compute x + y, where x and y are given in unary representation. Assume that the non-blank portion of the input tape consists of x occurrences of ones (to represent x) followed by a $ sign and then y occurrences of ones with an infinite number of blanks on both sides of the non-blank portion of the tape. The non-blank portion of the output of your Turing Machine is expected to be x ones followed by the $ sign followed by y ones followed by the # sign followed by x + y ones. For example, if x = 5 and y = 7, then your input tape will be 11111$1111111, which produces the output tape 11111$1111111#111111111111 (with blanks on both sides of the non-blank portion).

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question

TURING MACHINE:

draw the state diagram of a Turing Machine that will compute x + y, where x and y are given in unary representation. Assume that the non-blank portion of the input tape consists of x occurrences of ones (to represent x) followed by a $ sign and then y occurrences of ones with an infinite number of blanks on both sides of the non-blank portion of the tape. The non-blank portion of the output of your Turing Machine is expected to be x ones followed by the $ sign followed by y ones followed by the # sign followed by x + y ones. For example, if x = 5 and y = 7, then your input tape will be 11111$1111111, which produces the output tape 11111$1111111#111111111111 (with blanks on both sides of the non-blank portion).
Transcribed Image Text:draw the state diagram of a Turing Machine that will compute x + y, where x and y are given in unary representation. Assume that the non-blank portion of the input tape consists of x occurrences of ones (to represent x) followed by a $ sign and then y occurrences of ones with an infinite number of blanks on both sides of the non-blank portion of the tape. The non-blank portion of the output of your Turing Machine is expected to be x ones followed by the $ sign followed by y ones followed by the # sign followed by x + y ones. For example, if x = 5 and y = 7, then your input tape will be 11111$1111111, which produces the output tape 11111$1111111#111111111111 (with blanks on both sides of the non-blank portion).
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS