Theory of Computation Week 3 Nptel Assignment Answers
Are you looking for Theory of Computation Week 3 Nptel Assignment Answers? You’ve come to the right place! Access the latest and most accurate solutions for your Assignment 3 in the Theory of Computation course. Our detailed answers are designed to help you understand key concepts and excel in your studies.
Theory of Computation Week 3 Nptel Assignment Answers
Theory of Computation Week 3 Nptel Assignment Answers (July-Dec 2024)
Q1. Let L be a regular language. Then according to the pumping lemma for regular languages, there exists an integer p≥1 such that every string w∈L can be written as w=xyz satisfying the following conditions:
∣y∣≥1
∣xy∣≤p and
∀n≥0,xynz∈L
∃n≥0,xynz∈L
∀n≥0,xyzn∈L
∃n≥0,xnyz∈L
Answer: ∀n≥0,xynz∈L
Q2.Which states are equivalent in the following DFA?
Q5. Which of the following statements is not true? Any regular language satisfies the pumping lemma. Any language that does not satisfy the pumping lemma cannot be regular. Any language that satisfies the pumping lemma must be regular. A language that is not regular may also satisfy the pumping lemma.
Answer: Any language that satisfies the pumping lemma must be regular.
Q6. Which of the following languages is not regular?
{0n∣n is prime}
{0i1j∣i,j≥0} Set of binary strings where every occurrence of 1 is followed by 0 Set of binary strings such that the numbers represented by them in binary representation is divisible by 3
