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. (x-y, x>y a) f(x,y) = { 0, otherwise Input 11-1 1-1 111-1 1-1111 1111-11 111111-111 Output 1 0 11 0 11 111 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. (x-y, x>y a) f(x,y) = { 0, otherwise Input 11-1 1-1 111-1 1-1111 1111-11 111111-111 Output 1 0 11 0 11 111 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 Turing Machines using JFLAP to compute the fol- lowing function where x is an integer represented in unary. The value f(x) represented in unary should be on the tape surrounded by blanks after the calculation. Also show some test cases. f(x) = x (mod5)
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
(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 to compute x/3 for given positive integers. x is dividable by 3 and unary notation is used
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
Write a matlab program that computes the values of this function: Dn = 6 +((n -1) - ((6(n+1))/n) where the value of n is entered by the user and displayed with headings
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 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.
Derive the procedure for performing Lucas-Kanade algorithm for motion tracking when the motion is known to be affine: u(x,y) = a1*x + b1*y + c1; v(x,y) = a2*x + b2*y + c2 (the numbers are subscripts, not power)
A Perceptron can learn the Majority function, i.e., where each input unit is a binary value (0 or 1) and it outputs 1 if there are more 1s in the input than 0s. Assume there are n input units where n is odd. Select one: True False
TEST CASES: 1, 11, 111, 1111, 11111, 111111, 1111111, 1001, 11110 a 12. Design a Turing machine that computes the function f(x) = x - 2 if x > 20 if x < 2.