Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Tests > Test: Turing Machines & Undecidability- 1 - Computer Science Engineering (CSE) MCQ

Test Description

Test: Turing Machines & Undecidability- 1 for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Test: Turing Machines & Undecidability- 1 questions and answers have been prepared
according to the Computer Science Engineering (CSE) exam syllabus.The Test: Turing Machines & Undecidability- 1 MCQs are made for Computer Science Engineering (CSE) 2024 Exam.
Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Turing Machines & Undecidability- 1 below.

Solutions of Test: Turing Machines & Undecidability- 1 questions in English are available as part of our course for Computer Science Engineering (CSE) & Test: Turing Machines & Undecidability- 1 solutions in
Hindi for Computer Science Engineering (CSE) course.
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Turing Machines & Undecidability- 1 | 8 questions in 10 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study for Computer Science Engineering (CSE) Exam | Download free PDF with solutions

1 Crore+ students have signed up on EduRev. Have you? Download the App |

Test: Turing Machines & Undecidability- 1 - Question 1

The number of states required to automate the last question i.e. {a,b}*{aba}{a,b}* using finite automata:

Test: Turing Machines & Undecidability- 1 - Question 2

Which of the following problems are decidable?

Test: Turing Machines & Undecidability- 1 - Question 3

Which of the following are decidable?

I. Whether the intersection of two regular languages is infinite

II. Whether a given context-free language is regular

III. Whether two push-down automata accept the same language

IV. Whether a given grammar is context-free

Detailed Solution for Test: Turing Machines & Undecidability- 1 - Question 3

Test: Turing Machines & Undecidability- 1 - Question 4

Which of the following problems is undecidable?

Detailed Solution for Test: Turing Machines & Undecidability- 1 - Question 4

Test: Turing Machines & Undecidability- 1 - Question 5

Which of the following statements is/are FALSE?

1. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.

2. Turing recognizable languages are closed under union and complementation.

3. Turing decidable languages are closed under intersection and complementation.

4. Turing recognizable languages are closed under union and intersection.

Detailed Solution for Test: Turing Machines & Undecidability- 1 - Question 5

Test: Turing Machines & Undecidability- 1 - Question 6

Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive.

Which of the following statements is not necessarily true?

Detailed Solution for Test: Turing Machines & Undecidability- 1 - Question 6

Test: Turing Machines & Undecidability- 1 - Question 7

Which of the following is true for the language

Detailed Solution for Test: Turing Machines & Undecidability- 1 - Question 7

Test: Turing Machines & Undecidability- 1 - Question 8

If L and L' are recursively enumerable, then L is

Detailed Solution for Test: Turing Machines & Undecidability- 1 - Question 8

Information about Test: Turing Machines & Undecidability- 1 Page

In this test you can find the Exam questions for Test: Turing Machines & Undecidability- 1 solved & explained in the simplest way possible.
Besides giving Questions and answers for Test: Turing Machines & Undecidability- 1, EduRev gives you an ample number of Online tests for practice

Download as PDF