Given a Turing machine that accepts a palindrome using two tapes, give the execution trace with the string bbabb, in a step by step manner. The specifications of the TM are as follows: The input alphabet is E = {a,b} and the tape alphabet is I = The set Q of states consists of the following five states: {c, b, 0}. start state; copy w to the second tape w has been copied; head of first tape moves to the left head of first tape moves to the right; head of second tape moves to the left; until now, all tests were positive Io : 41 : 12 : Jaccept : accept state Ircjoct : reject state.

Given a Turing machine that accepts a palindrome using two tapes, give the execution trace with the string bbabb, in a step by step manner. The specifications of the TM are as follows: The input alphabet is E = {a,b} and the tape alphabet is I = The set Q of states consists of the following five states: {c, b, 0}. start state; copy w to the second tape w has been copied; head of first tape moves to the left head of first tape moves to the right; head of second tape moves to the left; until now, all tests were positive Io : 41 : 12 : Jaccept : accept state Ircjoct : reject state.

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

Construct a Turing machine that takes strings over the alphabet {a,b} on the tape, and moves the whole string over to the right one cell position. When you're done, the tape should essentially look the same (since it's infinite on both ends…) but you will know (and people who look at your code will know) that in fact you moved the string over by one space to the right. After moving the string over, the turing machine should move to the left-most cell in the string and than go to the HALT state.
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.
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.
Create a Turing machine that when started anywhere on the tape will halt if and only if there is a 0 somewhere on the tape., since it only lets you enter a single input string as the starting configuration of the tape. （For this problem, the tape can start with 0s and 1s scattered anywhere on the tape - they do not have to be contiguous. Any permutation of 0s, 1s and blanks is a possible starting configuration.）
Describe a Turing machine (including an explicit state diagram) which, when started with a bit string on the tape with the tape head pointing at the first bit, will decrement the bit string, and then enter the accept state. If the bit string has no 1 bits (i.e., it represents 0), enter the reject state. (So, if we start with 1001100, the binary representation of 76, we should replace it with 1001011, the binary representation of 75.)
Consider the Turing Machine defined as follows: (q0,0,q0,0,R), (q0,1,q1,0,R), (q0,B,q2,B,R), (q1,0,q1,0,R), (q1,1,q0,1,R) and (q1,B,q2,B,R). Describe what this TM does when presented with bit strings defined over the alphabet Σ = {0,1} as input. (Note: B = Blank).
Build a Turing Machine T.M with three tracks that add two binary numbers. We will consider that the datas are stored in the first two tracks and are aligned to the right. The result will be written to the third track which is initially empty.
Create a Turing Machine where the alphabet is { a b c } and L be the language of all words in which all the a's come before the b's and there are the same number of a's as b's and arbitrarily many c's that can be in front, behind, or among the a's and b's. These strings should be accepted ab abc acb cab cacbc caaccbcb caabcb ccacaabcccbccbc These strings should be rejected a b c ba bab abab abbab bbbbaab bbbbbbbbb aaaabbbbb aaabbbbaaabbbb handwritten digaram
Draw a Turing machine that has an input alphabet of { a, b, c }, and when it runs on an input string, it changes all the b’s to d’s, leaving the a’s and c’s unchanged.
Write a Turing machine that converts its input from binary to unary. In other words, if the input is the string x ∈ {$, 0, 1} ∗ , a $ followed by the binary expansion of the nonnegative integer n (for example, $101 to represent n = 5), then the machine outputs the string 1^n (e.g., 1^5 = 11111). You may assume the input string will be in this format, i.e., a $ followed by either just a 0, or followed by a binary string beginning with 1. Please use the simulator below to check if your turing machine is giving correct output or not: Format the Turing machine to be used with the simulator here: http: //web.cs.ucdavis.edu/~doty/automata/.
Write a 2 tape Turing machine that converts its input from binaryto unary. In other words, if the input is the string x ∈ {$, 0, 1}∗, a $ followed by thebinary expansion of the nonnegative integer n (for example, $101 to represent n = 5), thenthe machine outputs the string 1^n(e.g., 1^5 = 11111). You may assume the input stringwill be in this format, i.e., a $ followed by either just a 0, or followed by a binary stringbeginning with 1.
draw a Turing Machine that accepts strings in each of the languages below. Includethe septuple of the language with transition functions as well. a . L = { a n bn an bn : n ≥ 1 } b . L = { a n b m an+m: n ≥ 0, m ≥ 1} c . L = {w : w ∈ { a ,b}+ , |w| is a multiple of 4} d. L = {a n bm bn am : m ≥ 1 , n > m } e. L = {wcw : w ∈ { a ,b}* }