Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
QUESTION 11 Which of the following in false? O a) A language is a context-sensitive language if it can be generated by a context-sensitive grammar O b)A context sensitive grammar is an unrestricted grammar in which productions are length-decreasing O ) Context sensitive languages are a generaluation of context free languages O d) Context grammars cannot include A productions, and a context-sensitive language cannot include A QUESTION 12 Which of the following gives a positive result to the pumping lemma restrictions and requirements (that is a language is a CFL)? O a) (a' b'e'2 0) O b) (o' t'2 0) O c) (ss Ie (a, b)) O d) None of the mentioned above QUESTION 13 Which of the following is false? O a) The tape provides the memory needed during computation and serves as the output device. O b)A Turing machine will have two halt states, one denoting acceptance and the other rejection O ) One crucial difference between a Turing machine and an FA or POA is that a Turing machine is not restncted to a single pass through the input d) A language is Turing recognizable if and only if all multitape Turing machine recognizes it O e) TM is a general model of computation implies that any algorithmic procedure that can be carried out at all, by a computer, can be carmed out by QUESTION 14 Which of the folowing is false? O a) IfLCE is accepted by a TM T that halts on every input string, then Lis recursve O b) L1 and L2 are both recursively enumerable languages over 2. then L1UL2 and L1n L2 are also recursively enumerable O C) Every recursively enumerable language is recursive O d) If L1 and L2 are both recursive languages over 2, then L1u L2 and L1n L2 are also recursive.

QUESTION 11 Which of the following in false? O a) A language is a context-sensitive language if it can be generated by a context-sensitive grammar O b)A context sensitive grammar is an unrestricted grammar in which productions are length-decreasing O ) Context sensitive languages are a generaluation of context free languages O d) Context grammars cannot include A productions, and a context-sensitive language cannot include A QUESTION 12 Which of the following gives a positive result to the pumping lemma restrictions and requirements (that is a language is a CFL)? O a) (a' b'e'2 0) O b) (o' t'2 0) O c) (ss Ie (a, b)) O d) None of the mentioned above QUESTION 13 Which of the following is false? O a) The tape provides the memory needed during computation and serves as the output device. O b)A Turing machine will have two halt states, one denoting acceptance and the other rejection O ) One crucial difference between a Turing machine and an FA or POA is that a Turing machine is not restncted to a single pass through the input d) A language is Turing recognizable if and only if all multitape Turing machine recognizes it O e) TM is a general model of computation implies that any algorithmic procedure that can be carried out at all, by a computer, can be carmed out by QUESTION 14 Which of the folowing is false? O a) IfLCE is accepted by a TM T that halts on every input string, then Lis recursve O b) L1 and L2 are both recursively enumerable languages over 2. then L1UL2 and L1n L2 are also recursively enumerable O C) Every recursively enumerable language is recursive O d) If L1 and L2 are both recursive languages over 2, then L1u L2 and L1n L2 are also recursive.

Database System Concepts
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
icon
Related questions
Question

Computer Science

cosc 3302 intro to computer theory
need answer asasp 
QUESTION 11 Which of the following is false? O a) A language is a context-sensitive language if it can be generated by a context-sensitive grammar. O b)A context-sensitive grammar is an unrestricted grammar in which productions are length-decreasing O c) Context-sensitive languages are a generalization of context free languages O d) Context- grammars cannot include A-productions, and a context-sensitive language cannot include A QUESTION 12 Which of the following gives a positive result to the pumping lemma restrictions and requirements (that is a language is a CFL) ? O a) (a' b'e'i2 0) O b) (o' 1' 2 0) O c) (ss |sE (a, b)") O d) None of the mentioned above QUESTION 13 Which of the following is false? O a) The tape provides the memory needed during computation and serves as the output device. O b)A Turing machine will have two halt states, one denoting acceptance and the other rejection O c) One crucial difference between a Turing machine and an FA or PDA is that a Turing machine is not restricted to a single pass through the input O d) A language is Turing-recognizable if and only if all multitape Turing machine recognizes it O e) TM is a general model of computation implies that any algorithmic procedure that can be carried out at all, by a computer, can be carred out by a TM QUESTION 14 Which of the following is faise? O a) IHLCE is accepted by a TM T that halts on every input string, then Lis recursve O b) If L1 and L2 are both recursively enumerable languages over 2. then L1 U L2 and L1n L2 are also recursively enumerable O C) Every recursively enumerable language is recursive O d) If L1 and L2 are both recursive languages over 2, then L1u L2 and L1N L2 are also recursive.
Transcribed Image Text:QUESTION 11 Which of the following is false? O a) A language is a context-sensitive language if it can be generated by a context-sensitive grammar. O b)A context-sensitive grammar is an unrestricted grammar in which productions are length-decreasing O c) Context-sensitive languages are a generalization of context free languages O d) Context- grammars cannot include A-productions, and a context-sensitive language cannot include A QUESTION 12 Which of the following gives a positive result to the pumping lemma restrictions and requirements (that is a language is a CFL) ? O a) (a' b'e'i2 0) O b) (o' 1' 2 0) O c) (ss |sE (a, b)") O d) None of the mentioned above QUESTION 13 Which of the following is false? O a) The tape provides the memory needed during computation and serves as the output device. O b)A Turing machine will have two halt states, one denoting acceptance and the other rejection O c) One crucial difference between a Turing machine and an FA or PDA is that a Turing machine is not restricted to a single pass through the input O d) A language is Turing-recognizable if and only if all multitape Turing machine recognizes it O e) TM is a general model of computation implies that any algorithmic procedure that can be carried out at all, by a computer, can be carred out by a TM QUESTION 14 Which of the following is faise? O a) IHLCE is accepted by a TM T that halts on every input string, then Lis recursve O b) If L1 and L2 are both recursively enumerable languages over 2. then L1 U L2 and L1n L2 are also recursively enumerable O C) Every recursively enumerable language is recursive O d) If L1 and L2 are both recursive languages over 2, then L1u L2 and L1N L2 are also recursive.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Bare Bones Programming Language
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS