не а mistic, single tape Turing Machine with at states, that copies the letters before the *, to after the *, so that the letters are interleaved as follows: y occurrences of the first letter, followed by a occurrences of the second, followed by y occurrences of the first, etc... with any remaining letters (also interleaved) at the end. The input should remain unchanged. So, returning to the input examples above, the Turing Machine should halt with the following on its tape respectively: ccccccccddddd×cccddeccddced ccddddccdddd • cccccddddd*cccddccddd ● C*C • dddddd

не а mistic, single tape Turing Machine with at states, that copies the letters before the , to after the , so that the letters are interleaved as follows: y occurrences of the first letter, followed by a occurrences of the second, followed by y occurrences of the first, etc... with any remaining letters (also interleaved) at the end. The input should remain unchanged. So, returning to the input examples above, the Turing Machine should halt with the following on its tape respectively: ccccccccddddd×cccddeccddced ccddddccdddd • cccccdddddcccddccddd ● CC • dddddd

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

4. LetΣ ={a, b}. LetL={aibai|i≥0}.Give a Turing machine (TM) that accepts the languageL.Assume (as in the examples done in our course videos) that, when theTM starts, the head is on a blank symbol,∆, and the input string isimmediately after that blank symbol on the tape. For example, if theinput string wereaaabaaa, then the inital tape configuration would be∆aaabaaa
Build a Turing Machine T.M. with three tracks that receives two binary numbers and indicates which of the two is higher. We will consider that the data are stored in the first two tracks and aligned to the right, it means, the least significant bits of both are located in the same column. In the third track it will be written a B, a L or an E, indicating respectively that the first number is larger, smaller or equal to the second.
Define a Turing machine that accepts an integer n as an input string in unary representation, w = { 1 } *, and calculates n mod 3. When the machine halts, the tape should contain only the unary representation of f(w) followed by a zero. For example, ƒ(1111) = 10 or f(11111) 11111) = 0.
Draw a Turing machine that takes as input a string w ∈ { 0, 1, 2}*, erases the tape contents,and leaves TRUE left justified on the tape if the substring 0000 does not occur in the inputstring, otherwise leaves FALSE left justified on the tape. Give a brief description of how thetape is used and how the machine works.
In the homework we saw Turing machines for AND, OR, NOT. Here's the definition for XOR. q0 0 B q1 q1 BR q2 д0 1 В q3 q3 BR q4 q4 0 1 q5 q4 1 0 q6 Trace the machine's execution on input 11 by showing the successive configurations. List one configuration per line with a single space separating each part of the configuration. Recall that the parts of the configuration are in the following order: current-state current-head tape-to-left tape- to-right. Use "e" for ɛ and use it only in the "tape-to-left" or "tape-to-right" positions when there is nothing but blanks in those directions. Otherwise list all characters explicitly (and use B for a blank character when needed). initially q0 1 e 1 Step 1 Step 2 Step 3
Draw a state diangram for a Turing machine which, when given an input string 0", outputs 0"1". For example, if the tape contains 0000 at the beginning, then the tape should contain 00001111 when the TM halts. You may omit transitions that won't ever be taken. 4.
Construct a Turing Machine with vocabularyi-(0,1). that erases any data given as input. Hence this Turing machine is to be designed such that, when an arbitrary sequence of Os and 1s is given as input to the machine, It replaces all symbols with symbol B (which represents "Blank) and then halts. For example, if there is initially". B110100B ." on the tape, then the final content of the tape must be ". BBBBBBBB . Make sure that your machine works with any sequence of 0s and 1s with arbitrary finite length. Assume that there is initially no blank (B) symbol in between the leftmost and rightmost non-blank positions on the tape. O (so 0. 51. B. R). (5o 1. 5. B. R). (51. 0. S1. B. R). (5. 1, st. BL) O (so 0. 51. B. RV (So, 1s, B. R). (S. B, s1. B, R). (S. 0. so B. L). (s1, 1, so B L) O isp. 0. S. B. R). (so. 1, 51. B. R). (5, 1, So. B. L). (Sp. B, St. 1. R) O 6o 0. so B, R), (so 1. so. L) (5o B 51. 8. L) O 5o 0, 51, B. R). (s1. 0. 5. B. R). (s, 1. 5. B, R) O Go 0, so B. RI (5o 1.5o B. R)
We are going to write a Turing machine that reads a string of 1's as input and produces a 1 for output if the string is a length that is a multiple of 3 and outputs a O otherwise. The 1 or O should be spaced 1 position to the right of the end of the input. You may assume that the input contains only zero or more 1's. For example here are four before and after snapshots. Before After B1 В Input is zero 1's (0 is a multiple of 3) <== 1 1 0 11 11 0 111 111 1 Here is a Turing machine that does most of the work but is missing one instruction. Fill the blank with the instruction needed. Follow the format of the other instructions (ie, current-state current- head head-instruction new-state, with exactly one space between each). qO 1 R q1 q1 1 R q2 q2 1 R q0 q0 BR q3 q1 BR q4 93 В 1 q5 q4 B0 q6 Hint: I suggest you draw what is given and then figure out what single instruction will make the machine behave as described.
b/a/L c/c/L a/c/R c/b/R a/c/R a/b/L c/a/L bp/R b/b/R a/a/R c/c/R (b) In this part we are looking at the Turing-Machine above. We assume here that b is the blank symbol, {a,c} is the input alphabet. (1) Give two words recognised by this Turing Machine. (ii) Give a computation for the input cc. If you think the computation diverges, give the first 5 configurations of the computation.
Our goal is to construct a deterministic one-tape Turing machine that accepts strings over Σ = {a, b} which are palindromes. A palindrome is a string that is the same when read forwards and backwards, for example, abbabba. The Turing machine should operate in the following way: 1. Remember the first character of the input in the state control, and erase this character (replace it with a blank). 2. Move the head to the last (right-most) character of the input. 3. Verify that this character is the same character as the one stored in the state control. If it is, delete this character. If it is a different character, immediately halt and reject. 4. Move the head to the left-most character of the input. 5. If there are any characters left on the input, repeat from step 1. 6. If in step 1 or 3 the tape is empty (i.e. all characters of the input have been erased), halt and accept. First, take a minute to think about the algorithm and convince yourself that it indeed accepts all palindromes…
create a 2 tape Turing machine (use JFLAP) that has on tape 1 the alphabet of a,b,null, on tape 2 the alphabet is 0,1,2,3, null. Tape 1 has initial content of (a+b)*, Tape 2 has initial content of (0+1)* Begin by processing tape 1, if the substring aa is found on tape 1, search tape 2 for the first 00 substring and replace it with 22 if the substring bb is found on tape 1, search tape 2 for the first 11 substring and replace it with 33. If at anytime aa does not have a matching 00 reject if at anytime bb does not have a matching 11 reject else accept after all of tape 1 has been processed.
Not so. The real question states that: Construct a turing machine that computes the function ?(?) = 2?, , i.e. if the input is 0^? then the output would be 0^2? e.g. if it says 000 on the tape before the machine is run it should read 000000 on the tape when it has stopped.