1. A language L is Turing-recognizable if there exists a TM M such that given an input strir w over the alphabet of L, M a) Halts and accepts w b) Halts and rejects w c) Loops and returns no answer d) Both (a) and (b) e) All of (a), (b), and (c) 2. Which ones of the following languages are Turing-decidable: a) ADFA = {< D, w> | D is a DFA that accepts input string w} b) EQDFA = { | D1 & Dz are DFAS and L(D;) = L(D2) } c) Both (a) & (b) d) None of the above 3. Which ones of the following languages are Turing-recognizable, but not decidable: a) AREX = { | R is a regular expression that describes string w} b) EDFA = { | D is a DFA and L(D) = Ø } c) ECFG = { | G is a CFG and L(G) = Ø } d) None of the above

1. A language L is Turing-recognizable if there exists a TM M such that given an input strir w over the alphabet of L, M a) Halts and accepts w b) Halts and rejects w c) Loops and returns no answer d) Both (a) and (b) e) All of (a), (b), and (c) 2. Which ones of the following languages are Turing-decidable: a) ADFA = {< D, w> | D is a DFA that accepts input string w} b) EQDFA = { | D1 & Dz are DFAS and L(D;) = L(D2) } c) Both (a) & (b) d) None of the above 3. Which ones of the following languages are Turing-recognizable, but not decidable: a) AREX = { | R is a regular expression that describes string w} b) EDFA = { | D is a DFA and L(D) = Ø } c) ECFG = { | G is a CFG and L(G) = Ø } d) None of the above

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

turing machine T_F
Let for ∑= {0,1} R= (∑∑∑) *, the language of R would be a) {w | w is a string of odd length} b) {w | w is a string of length multiple of 3} c) {w | w is a string of length 3} d) All of the mentioned Theory of automata question
8 Let L be a language defined over {a,b}* and recognizable by a finite automaton. The language Reverse (L) = {w: Reverse(w) e L} is : choose the most correct answer: a regular language a context-free language a turing acceptable language not a regular language
Draw a Turing Machine that accepts the following language ing). L = {w ∈ {a,b}* | w is a palindrome }. (For example, a, b, bb, abba, aba, bbb are members of L, but abb, ba, bba are not.}
7. The following shows the state transition diagram of a Turing machine for language A = {a² In>0}. For example, strings a, aa, aaaa, and aaaaaaaa are members of language A. Modify this Turing machine to recognize language B = {a(2)-1 | n ≥ 0). For example, strings e, a, aaa, and aaaaaaa are members of language B. You can modify, add, or remove transitions, but you cannot add or remove any states. a → a, L 0-0,4 1+1, L 0-1,L U-1,L z→z,R 0 0-1,L U-1,L a➡z, R 31-0, R 1-0, R 2Daa,R aa, R 1 0-0, R 1-1,R U-U,R reject 0-0, R 31+1,R U-UR accept
TURING MACHINE
L = { <A,B> | A and B are PDAs and L(A) L(B) } a) prove that L is undecidable b) Prove that L is not Turing recognizable
The language L is defined as L={ (ab)"(bc)“ | n>1} over the alphabet E={a,b,c}. Build a Turing Machine that accepts the language L. i) Explain shortly the logic behind your design. ii) Draw the Turing Machine. iii) Show the execution chain for the word ababbcbc
Turing Machines, hand drawn
(a) There is a Turing machine that decides the set Ø (b) There is a Turing machine that is not a decider and that recognizes the set Ø. (c) There is a Turing machine that decides the set Σ* (d) There is a Turing machine that is not a decider and that recognizes the set Σ*. (e) There is a Turing machine that decides the set {ww | w€ [*} (f) There is a Turing machine that is not a decider and that recognizes the set {www = [*}
L = {am+n bm cn | m,n ≥ 1} over Σ = {a, b, c} A. Design PDA for L (with as less as states possible) B. Is L is regular language? C. Verify it by Pumping Lemma
Source: https://www.mog.dog/files/SP2019/Sipser_Introduction.to.the.Theory.of.Computation.3E.pdf