Design a Turing Machine recognizing each of the following languages (note that the transition functions of the Turing Machine must be in the format of "a → b,L/R", namely the machine reads symbol a from the tape, writes b to the cell to replace a, and then goes to either left L or right R): (1) {w|w=a²"b", n>0}

Design a Turing Machine recognizing each of the following languages (note that the transition functions of the Turing Machine must be in the format of "a → b,L/R", namely the machine reads symbol a from the tape, writes b to the cell to replace a, and then goes to either left L or right R): (1) {w|w=a²"b", n>0}

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 (TM) recognizing each of the following languages and draw its state diagram.
Design a Turing machine with no more than three states that accepts the language L(a(a+b)*). Assume that Σ = {a,c}. -> Is it possible to do this with a two-state machine? Why or why not?
Construct a turing machine which accepts the language of a*b*c, a*b*c,... over ∑ = {a,b,c}. Show the essential components such as State Diagram, Tape, Tape Head, Control Unit and Transition Table.
a) Draw a state diagram for a Turing Machine to recognize Language bb* , where Σ={b}. Explain how your TM works and why it is correct. Define your designed TM formally by expressing its tuple parts. b) Now let the input string be bbbb . Run your machine on this input and show step by step how this string is accepted by your TM.
draw the state diagram of a Turing Machine that will compute x + y, where x and y are given in unary representation. Assume that the non-blank portion of the input tape consists of x occurrences of ones (to represent x) followed by a $ sign and then y occurrences of ones with an infinite number of blanks on both sides of the non-blank portion of the tape. The non-blank portion of the output of your Turing Machine is expected to be x ones followed by the $ sign followed by y ones followed by the # sign followed by x + y ones. For example, if x = 5 and y = 7, then your input tape will be 11111$1111111, which produces the output tape 11111$1111111#111111111111 (with blanks on both sides of the non-blank portion). handwritten will work
Design a Turing machine to compute the x mod y, y>0 function. On entry, the number is represented as a unary number using |. This way, 5 will turn to |||||. When two numbers are inputted, they are placed as unary numbers separated by #. The answer must contain states, with clear instructions on what to do when finding a symbol, namely what state to go to, where to go (Stay, Left, Right) and what symbol to put in a cell. E.g.: q0 If found _, put _, go to q1 and Stay. If found |, put |, go to q0 and Left. q1 If found _, put _, go to q1 and Right If found |, put X, go to q2 and Right. Etc… Feel free to use as many auxiliary symbols as you need. In the end, the program needs to output n '|' symbols without spaces('_') or anything, where n is the result of x mod y. So, the result for input 10 and 7 and output for it would look like this: We input numbers in the machine, and they appear on the Turing machine line like this, every symbol in its cell: Input: ||||||||||#||||||| Once…
Design a Turing machine (showing its state diagram) for the language above. Show all transitions, including those that go to the reject state. What is your tape alphabet? What does each state intuitively represent?
Give state diagram for Turing machine with one tape that recognizes the following language: A= {w ∈ {0, 1}∗ | w contains equal number of ones and zeros (in any order)}
Generate a Turing machine that identifies language M = Make a state diagram and write the formal definition using M = (Q, Σ, Γ, δ, q, a, r) and write two examples of accepted words.
Design a Turing machine that accepts a string of a and b where the number of a's is one more than the number of of b's? first write the outline then the draw the diagram.
Design a Turing machine that, when started scanning a square on a completely black tape, writes the string abab on the tape and halts scanning the leftmost symbol of this string. Try to design a machine that has no more than four states, q0 through q3.
Design a Turing machine with no more than three states that accepts thelanguageL (a (a + b)∗).Assume that Σ = {a, b}. Is it possible to do this with a two-state machine?