X

tejkkarani@gmail.com

Courses Theory of computation Announcements Course Forum Progress Mentor

Unit 8 - Week - 7

Course
outline Assignment 7
Due date for this assignment: 2017-09-12, 23:59 IST.
How to Access the
1) Consider the following languages 5 points
Portal ?

L1 = {< M > M is a single tape TM that on any inputxdoes not change the input portion of the tape
Week - 1

L2 = {< M > M is a single tape TM that on any inputxdoes not change any portion of the tape}
Week - 2

Week - 3 Which of the following is correct?

Week - 4
L1 is decidable but L2 is undecidable
Week - 5
L1 is undecidable but L2 is decidable
Week - 6
Both L1 and L2 are decidable
Week - 7
Both L1 and L2 are undecidable
Decidability
properties of 2) Which of the following are correct? 3 points
Regular and
Context Free
Languages
If L1 m L2 and L2 m L3 , then L1 m L3

Undecidability

More on If L1 m L2 then L2 m L1

Undecidability

Reduction If L1 m L2 then
L1 m

L2

Applications of

Reduction L m L

Quiz : Assignment 3) Consider the following language 4 points

7
L = {< M > M is a TM such that ifM acceptswthenM acceptswwalso}
Week - 8

Which of the following is correct?

L is decidable

L is recognizable but undecidable

L is unrecognizable and L is decidable

L is unrecognizable and L is undecidable

Let L and L be two languages such that L L . Consider the following statements
 4) Let L1 and L2 be two languages such that L1 m L2 . Consider the following statements 2 points

S1 : If L1 is non-regular then L2 is also non-regular

S2 : If L1 is non-CFL then L2 is also non-CFL

Which of the following is correct?

S1 is true but S 2 is false

S2 is true but S 1 is false

Both S 1 and S 2 are true

Both S 1 and S 2 are false

5) Consider the following languages 2 points

EQ(P 1, P 2) = {< P 1, P 2 > P 1andP 2are pushdown automata such thatL(P 1) = L(P 2)}

EQN (D1, D2) = {< D1, D2 > D1andD2are DFAs such that|L(D1)| = |L(D2)|}

Which of the following is correct?

EQ(P 1, P 2) is decidable but EQN (D1, D2) is not

EQN (D1, D2) is decidable but EQ(P 1, P 2) is not

Both EQ(P 1, P 2) and EQN (D1, D2) are decidable

Both EQ(P 1, P 2) and EQN (D1, D2) are not decidable

6) Consider the following languages 2 points

L1 = {< D > Dis a DFA which accepts at most 1000 strings}

L2 = {< D > Dis a DFA such thatL(D)is infinite}

Which of the following is correct?

L1 and L2 both are decidable

L1 and L2 both are recognizable but not decidable

L1 is recognizable but not decidable and L2 is not recognizable

L1 is decidable and L2 is recognizable but not decidable

7) Let L1 and L2 be two languages. If L1 m L2 and L1 is Turing recognizable but not decidable, 4 points
then which of the following are necessarily true?

L2 is Turing recognizable

L2 is Turing recognizable

L2 is not Turing recognizable


L2 is not Turing recognizable

8) Which of the following statements are false? 1 point

Every subset of a decidable language is decidable

Every superset of a decidable language is decidable

Every subset of an undecidable language is undecidable

Every superset of an undecidable language is undecidable

You may submit any number of times before the due date. The final submission will be considered for grading.
Submit Answers

Previous Page End

2014 NPTEL - Privacy & Terms - Honor Code - FAQs -

A project of In association with

Funded by Powered by