A Given Turing-Decidable languages A (decided by Turing machine MA) and B (decided by Turing machine MB). Give an implementation-level description of a single tape deterministic Turing machine, MACB, that decides An B = {w|w is a member of A and w is a member of B}. That is, show that Turing decidable languages are closed under intersection. MADB On input string w: =

A Given Turing-Decidable languages A (decided by Turing machine MA) and B (decided by Turing machine MB). Give an implementation-level description of a single tape deterministic Turing machine, MACB, that decides An B = {w|w is a member of A and w is a member of B}. That is, show that Turing decidable languages are closed under intersection. MADB On input string w: =

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

Give a description representation of a Turing Machine Mg for language B = {w over {0, 1, #3*| w contains an equal number of O's and 1's and w contains exactly 1 #"}. 10# E B, 01#10 EB, 01##01 € Band #001 € B. In this case, your description should be for a single tape TM. In addressing be sure to pay special attention to final (halting) configurations, when required. you are expected to provide pseudocode for the corresponding machines. Remember that in your pseudocode, you need to be clear of what are your reading and writing on the tape (and which tape if you use more than 1), the direction in which the tape heads will move, and when the Turing Machine should halt and accept and/or halt and reject. Having said that, the point is not for you to describe state-by-state what the Turing Machine would look like. Instead, the goal of the description is for you to offer a high level overview that considers what to read/write in which order, in which directions the tape would move and how you…
Let Σ = {a, b}. Give a DFA/RE, CFG/PDA, a Turing machine, if it exists, for the language L = {w = wR|w ∈ Σ ∗ , l(w) is odd}, where wR denotes the reverse of w and l(w) denotes the length of w. If it does not exist, prove why it does not exist.
Create a Deterministic Finite Automaton (DFA) for the language L that is defined over the input alphabet E = {a, b} and has all of the following properties: i. Second and third letters of its words are the same, ii. Its words are longer than four letters, and iii. Its last letter cannot be the letter b. My answer is true or wrong? If it is wrong can you fix it? 96 91 92 a a. 95 9. 96
Create a Turing machine that computes a mapping reduction from L1 ≤ m L2 where L1 ＝ {w : w ∈ {a,b}* and |W| is even} and where L2 ＝ {anbn : n ≥ 0}
Develop a Turing machine for the language L={w∈{0,1}∗ ||w|isoddandwcontainsatleastone1}. This means that the Turing machine should accept all strings over {0, 1} of odd length that contain at least one 1. Show the state transition diagram in addition to your defi- nition of the Turing machine. Show the working of your Turing machine on the strings “0010”, “00101”, and “000”.
Consider the language L = {a i b j c k | i 6= j, j 6= k, i 6= k}; it is not a context- free language. Show that it nevertheless satisfies the conditions of the context-free pumping lemma, that i s, show that there exists an m so that for all strings w in L of length at least m, we can write w = uvxyz with |vxy| ≤ m, |vy| ≥ 1, such that ∀i ≥ 0 : uvixyi z ∈ L.
Draw and write out the transition functions for a 2-tape Turing machine that recognizes the language {w#w|w ∈ {0, 1} ∗ }.
Consider the language L = {a'bck | i + j,j # k, i + k}; it is not a context- free language. Show that it nevertheless satisfies the conditions of the context-free pumping lemma, that i s, show that there exists an m so that for all strings w in L of length at least m, we can write w = uvxyz with |vxy| 1, such that Vi > 0 : uv'xy'z € L.
A palindrome is a string that reads the same backward as forward, i.e., w = wR. A palindromic language is one in which all the strings are palindromes, i.e., some subset of P = {w | w ∈ Σ∗ and w = wR} Consider the language L ={<B> | B is a DFA with input alphabet Σ and L(B) contains a palindrome}. Show that L is decidable. Explain step by step.
Consider the language L consisting of encodings (M) of TMs M such that M is a deterministic one-tape Turing machine. Pick all that apply. L is decidable. L is recognisable.
Let L be a language: L = {: M be TM which runs in polyno time}, and prove L is undecidable for the following scenario: A TM runs in polyno time if there exists a constant n > 0 such that, for all inputs y ∈ {0, 1} *, M(y) will halt at most |y| steps.
Let L = { M| M is a Turing machine and L(M) is set of all binary 0,1-strings of even length}, where L(M) is the language accepted by Turing machine M. Prove that L is undecidable by finding a reduction from to it, where ={<M,w>| M is a Turing machine and M accepts w}.