Design Turing Machines using JFLAP to compute the following functions for x and y positive integers represented in unary. The value f(x) or f(x,y) represented in unary should be on the tape surrounded by blanks after the calculation. f(x) = x mod 5 Input 1 Output 1 1111 0 11 1111111111 0 11111111111 1 1111 11111 1111111 Result Accept Accept Accept Accept Accept Accept

Design Turing Machines using JFLAP to compute the following functions for x and y positive integers represented in unary. The value f(x) or f(x,y) represented in unary should be on the tape surrounded by blanks after the calculation. f(x) = x mod 5 Input 1 Output 1 1111 0 11 1111111111 0 11111111111 1 1111 11111 1111111 Result Accept Accept Accept Accept Accept Accept

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

See similar textbooks

Similar questions

Design a Turing Machine to compute x/3 for given positive integers. x is dividable by 3 and unary notation is used
Design a Turing machine that computes the function S1 if w is even lo if w is odd Note that you need to use unary representation for w. For example, if w = 3, then representation f(w) = of w is 111.
design a turing machine that computes the function (2x+y) where x and y are positive integers represented in unary
Design a Turing machine to compute the function f (x) = 3x - 2, with x a positive integer represented in unary.
(b) Suppose that you were asked to design a Turing machine that, when started scan- ning a square on a completely blank tape, writes the string ababbaab on the tape and halts scanning the leftmost symbol of this string. What is the minimal number of states required in order to accomplish this?
Design a Turing Machine that computes the function f(w) = 1 if w is even. f(w) = 0 if w is odd.
Design a Turing Machine that takes 2 unary numbers on the tape, where the first number is greater than the second number, and computes and writes a unary number to the tape that is the first number minus the second number.
Design a Turing machine that multiplies any +ve number by four. So if tape contains the number 5 (in its binary form) then TM should leave 20 on the tape (in binary form). Basically you need to implement this function: Y = 4X
Design a Turing machine that computes the function f (x) = x − 2 if x > 2 = 0 if x ≤ 2.
Draw the transition diagrams for Standard Turing Machines that compute the following functions on (a) f(w) = ww where w is a string on the alphabet {a, b}. (b) f(a"b') = b'a"
Design a Turing Machine that accepts L= {w#w | w = {0, 1}*) when given the tape is as follows: second/right string 0 1 0 0 1 # 0 1 0 0 1 Tape first/left string
11. Design Turing machines to compute the following functions for x and y positive integers represented in unary. (a) f (x) = 3x. (b) f (x, y) = x - y, = 0, x> y, (c) f (x, y) = 2x + 3y. (d) f (2) = , = 1, if æ is even, %3D if x is odd. %3D (e) f (x) = x mod 5. %3D