o Construct a Standard Turing Machine to compute the function f(x) = [1. the ceiling of ▪ Assume is a positive integer represented in unary notation on the Turing machine's tape. • f(x) will also be a positive integer represented in unary notation on the Turing machine's tape. o Save your Standard Turing Machine as a JFLAP jff file, and submit that .jff file to Canvas as your solution to this exercise. zamples... o Example 1 • If x = 5, then f(x) = f(5) = [1 = [2.51 = 3 Turing machine input would be a string of five ones, which is the string 11111 Turing machine output should be a string of three ones, which is the string 111 o Example 2 If z = 8, then f(x) = f(8) = [1 = [4.01 = 4 Turing machine input would be a string of eight ones, which is the string 111111 Turing machine output should be a string of four ones, which is the string 1111 o Example 3 • If x= 15, then f(x) = f(15) = []=[7.51 = 8 ▪ Turing machine input would be a string of fifteen ones, which is the string 111111111111111 • Turing machine output should be a string of eight ones, which is the string 11111111 Example 4 If x = 6, then f(x) = f(6) = [1 = [3.0] =3 • Turing machine input would be a string of six ones, which is the string 111111 ▪ Turing machine output should be a string of three ones, which is the string 111
o Construct a Standard Turing Machine to compute the function f(x) = [1. the ceiling of ▪ Assume is a positive integer represented in unary notation on the Turing machine's tape. • f(x) will also be a positive integer represented in unary notation on the Turing machine's tape. o Save your Standard Turing Machine as a JFLAP jff file, and submit that .jff file to Canvas as your solution to this exercise. zamples... o Example 1 • If x = 5, then f(x) = f(5) = [1 = [2.51 = 3 Turing machine input would be a string of five ones, which is the string 11111 Turing machine output should be a string of three ones, which is the string 111 o Example 2 If z = 8, then f(x) = f(8) = [1 = [4.01 = 4 Turing machine input would be a string of eight ones, which is the string 111111 Turing machine output should be a string of four ones, which is the string 1111 o Example 3 • If x= 15, then f(x) = f(15) = []=[7.51 = 8 ▪ Turing machine input would be a string of fifteen ones, which is the string 111111111111111 • Turing machine output should be a string of eight ones, which is the string 11111111 Example 4 If x = 6, then f(x) = f(6) = [1 = [3.0] =3 • Turing machine input would be a string of six ones, which is the string 111111 ▪ Turing machine output should be a string of three ones, which is the string 111
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
Want in JFLAP only
![IS CACILIS...
o Construct a Standard Turing Machine to compute the function f(x) = [1,
the ceiling of
▪ Assume x is a positive integer represented in unary notation on the Turing machine's
tape.
▪ f(x) will also be a positive integer represented in unary notation on the Turing
machine's tape.
o Save your Standard Turing Machine as a JFLAP.jff file, and submit that .jff file to
Canvas as your solution to this exercise.
Examples...
Example 1
▪ If x = 5, then f(x) = f(5) = [1 = [2.5] =3
Turing machine input would be a string of five ones, which is the string 11111
Turing machine output should be a string of three ones, which is the string 111
• Example 2
If x = 8, then f(x) = f(8) = [1 = [4.0] =4
▪ Turing machine input would be a string of eight ones, which is the string 11111111
Turing machine output should be a string of four ones, which is the string 1111
o Example 3
• If x = 15, then f(x) = f(15) = [] = [ 7.5] = 8
▪ Turing machine input would be a string of fifteen ones, which is the string
111111111111111
Turing machine output should be a string of eight ones, which is the string
11111111
o Example 4
If x = 6, then f(x) = f(6) = [1 = [ 3.0] =3
■ Turing machine input would be a string of six ones, which is the string 111111
Turing machine output should be a string of three ones, which is the string 111](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9bdb9e67-def1-4779-a2d8-db4def7ca127%2F59005290-e1fa-4df7-ba80-23183f6e56a8%2F8s8hv5c_processed.png&w=3840&q=75)
Transcribed Image Text:IS CACILIS...
o Construct a Standard Turing Machine to compute the function f(x) = [1,
the ceiling of
▪ Assume x is a positive integer represented in unary notation on the Turing machine's
tape.
▪ f(x) will also be a positive integer represented in unary notation on the Turing
machine's tape.
o Save your Standard Turing Machine as a JFLAP.jff file, and submit that .jff file to
Canvas as your solution to this exercise.
Examples...
Example 1
▪ If x = 5, then f(x) = f(5) = [1 = [2.5] =3
Turing machine input would be a string of five ones, which is the string 11111
Turing machine output should be a string of three ones, which is the string 111
• Example 2
If x = 8, then f(x) = f(8) = [1 = [4.0] =4
▪ Turing machine input would be a string of eight ones, which is the string 11111111
Turing machine output should be a string of four ones, which is the string 1111
o Example 3
• If x = 15, then f(x) = f(15) = [] = [ 7.5] = 8
▪ Turing machine input would be a string of fifteen ones, which is the string
111111111111111
Turing machine output should be a string of eight ones, which is the string
11111111
o Example 4
If x = 6, then f(x) = f(6) = [1 = [ 3.0] =3
■ Turing machine input would be a string of six ones, which is the string 111111
Turing machine output should be a string of three ones, which is the string 111
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
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.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