Move three cells left (0, 0, 0, L, 1) (0, 1, 1, L, 1) Add 1: Move left (1, 0, 0, L, 2) (3, 1, 0, L, 3) Carry (1, 1, 1, L, 2) (1, A, 0, L, 2) Done Find left end of the string: Done and then fill out the blanks in the following chart to make it a complete state transition diagram for this TM. Make sure the instructions you choose fit into the diagram naturally and logically. In the diagram, state H means the 'Halt' state. You have to use your own text boxes here too. (1 point each blank) 1 O, L 0 O.L 0 A 0,L O,L 0 1 2 3 4 1 1 1,L 1.L H Given an integer say 45, to find the sum of 45 with 8 in binary form (see the figure below), we can use the TM designed in slides 79-90 of the notes "Turing Machines and Equivalent Models I" twice to find the result. A more effective way is to design a TM to do the addition with 8 directly. 1000 101101 A + = ? Such a TM can be designed by extending the TM designed in slides 79-90 of the notes "Turing Machines and Equivalent Models I". The TM has 14 instructions and 6 states: 0, 1, 2, 3, 4, and halt. Six instructions of such a TM have been given in the first and the second tables below. Fill out the remaining blanks in the first and the second tables and also blanks in the third table to show the remaining instructions of the TM (you have to use your own text boxes here)
Move three cells left (0, 0, 0, L, 1) (0, 1, 1, L, 1) Add 1: Move left (1, 0, 0, L, 2) (3, 1, 0, L, 3) Carry (1, 1, 1, L, 2) (1, A, 0, L, 2) Done Find left end of the string: Done and then fill out the blanks in the following chart to make it a complete state transition diagram for this TM. Make sure the instructions you choose fit into the diagram naturally and logically. In the diagram, state H means the 'Halt' state. You have to use your own text boxes here too. (1 point each blank) 1 O, L 0 O.L 0 A 0,L O,L 0 1 2 3 4 1 1 1,L 1.L H Given an integer say 45, to find the sum of 45 with 8 in binary form (see the figure below), we can use the TM designed in slides 79-90 of the notes "Turing Machines and Equivalent Models I" twice to find the result. A more effective way is to design a TM to do the addition with 8 directly. 1000 101101 A + = ? Such a TM can be designed by extending the TM designed in slides 79-90 of the notes "Turing Machines and Equivalent Models I". The TM has 14 instructions and 6 states: 0, 1, 2, 3, 4, and halt. Six instructions of such a TM have been given in the first and the second tables below. Fill out the remaining blanks in the first and the second tables and also blanks in the third table to show the remaining instructions of the TM (you have to use your own text boxes here)
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
Related questions
Question
fill in the blanks, if you can write on the pdf please do so
Transcribed Image Text:Move three cells left
(0, 0, 0, L, 1)
(0, 1, 1, L, 1)
Add 1:
Move left
(1, 0, 0, L, 2)
(3, 1, 0, L, 3)
Carry
(1, 1, 1, L, 2)
(1, A, 0, L, 2)
Done
Find left end of the string:
Done
and then fill out the blanks in the following chart to make it a complete state
transition diagram for this TM. Make sure the instructions you choose fit into
the diagram naturally and logically. In the diagram, state H means the 'Halt'
state. You have to use your own text boxes here too. (1 point each blank)
1
O, L
0
O.L
0 A
0,L O,L
0
1
2
3
4
1
1
1,L
1.L
H
Transcribed Image Text:Given an integer say 45, to find the sum of 45 with 8 in binary form (see
the figure below), we can use the TM designed in slides 79-90 of the notes
"Turing Machines and Equivalent Models I" twice to find the result. A more
effective way is to design a TM to do the addition with 8 directly.
1000
101101 A
+
=
?
Such a TM can be designed by extending the TM designed in slides 79-90
of the notes "Turing Machines and Equivalent Models I". The TM has 14
instructions and 6 states: 0, 1, 2, 3, 4, and halt. Six instructions of such a
TM have been given in the first and the second tables below. Fill out the
remaining blanks in the first and the second tables and also blanks in the
third table to show the remaining instructions of the TM (you have to use
your own text boxes here)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education