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

For each of the following languages, say whether it is decidable. Justify your answer in about 5-10 sentences. (a) L₁ = {(M, t) | Turing machine M accepts some input in at least t steps} (b) L2 = {(M) | Turing machine M infinite loops on some input} (c) L3 = {(M₁, M2) | M₁, M2 are Turing machines such that L(M₁) ‡ L(M₂)} (d) L₁ = {(M, t) | Turing machine M accepts every input in at most t steps}
A context sensitive language is accepted by: * 1-Turing machine 2-None of them 3-Finite automata 4-linear bounded automata Finite automata linear bounded automata
Let Mx be a Turing machine that decides the language X and let My be a Turing machine that decides the language Y. Describe a Turing machine M that decides the language XYX. (You don't have to formally define the machine. Describe the behaviour of the machine in sentences.)
4) Suppose L₁ and L₂ are decidable by TMS M₁ and M₂. Provide high-level Turing machine to show L₁ L₂ is decidable and lexicographically recursively enumerable.
Quick
I want unique answer
INTRODUCTION TO THE THEORY OF COMPUTATION For each of the following languages: • Give an algorithm for a Turing Machine. • Produce a Turing Machine that corresponds to that algorithm 101m0n1m|n, m≥ 1}
(a) Construct deterministic finite automata accepting the following languages: (i) {w e {0, 1}*| w is not in the regular language defined by 0*1*}; (ii) {w e {0, 1}*| w has an even number of O's or an odd number of l's} (pay attention to or in this definition); (iii) {w e {0,1}*|wends with a subword 01, i.e., w = x01 for some word r }.
(a) Construct deterministic finite automata accepting the following languages: {w e {0, 1}"| w is not in the regular language defined by 0"1"}; (ii) {w e (0, 1}"| w has an even number of O's or an odd number of l's) (pay attention to or in this definition); (ii ( E {0, 1}"| w ends with a subword 01, i.e., w = 101 for some word r}. (i)
Construct the state machine diagram of a single tape deterministic Turing Machine which accepts the language B = {ww^R| w ϵ {0, 1}*}. Needs Complete solution with 100 % accuracy.
(a) Construct deterministic finite automata accepting the following languages: {w e {0, 1}"| w is not in the regular language defined by 0"1"}; (ii) {w e (0, 1}"| w has an even number of O's or an odd number of l's) (pay attention to or in this definition); (ii (w E (0, 1}"|w ends with a subword 01, i.e., w = 101 for some word z}. (i)
L = { | A and B are PDAS and L(A) L(B) } a) prove that L is undecidable b) Prove that L is not Turing recognizable