DFA Minimization and Pumping Lemma

🎯 Learning Objectives

• Minimize a DFA using table-filling and equivalence algorithms
• Apply the Myhill-Nerode theorem to characterize regular languages
• Prove a language is non-regular using the pumping lemma
• Convert between DFAs, NFAs, and regular expressions
• Trace algorithm execution with step-by-step tables

1. DFA Minimization

1.1 Intuition

1.2 Table-Filling Algorithm

1.3 Worked Example

• On 0: δ(q0,0)=q1, δ(q1,0)=q2 → (q1, q2) unmarked
• On 1: δ(q0,1)=q2, δ(q1,1)=q3 → (q2, q3) marked ✓
• Since (q2, q3) is distinguishable, mark (q0, q1) ✓ Check (q0, q2):
• On 0: δ(q0,0)=q1, δ(q2,0)=q2 → (q1, q2) unmarked
• On 1: δ(q0,1)=q2, δ(q2,1)=q3 → (q2, q3) marked ✓
• Mark (q0, q2) ✓ Check (q1, q2):
• On 0: δ(q1,0)=q2, δ(q2,0)=q2 → (q2, q2) same state, OK
• On 1: δ(q1,1)=q3, δ(q2,1)=q3 → (q3, q3) same state, OK
• No marked pair found → (q1, q2) are equivalent Final table:

• States: {q0}, {q1, q2} → q1', {q3}
• Transitions: δ(q0,0)=q1', δ(q0,1)=q1', δ(q1',0)=q1', δ(q1',1)=q3, δ(q3,0)=q3, δ(q3,1)=q3

2. Myhill-Nerode Theorem

2.1 Intuition

2.2 Definition

2.3 Worked Example

3. The Pumping Lemma for Regular Languages

3.1 Intuition

3.2 Formal Statement

1. $|y| \geq 1$ (the loop is non-empty)
2. $|xy| \leq p$ (the loop is within the first p characters)
3. $xy^iz \in L$ for all $i \geq 0$ (pumping preserves membership)

3.3 Proving Non-Regularity

1. Assume $L$ is regular (pumping length $p$ exists)
2. Choose $s \in L$ with $|s| \geq p$ (strategically pick $s$)
3. Show that for ALL possible splits $s = xyz$ satisfying conditions 1-2, $xy^2z \notin L$ (pumping breaks membership)
4. Contradiction → $L$ is not regular

3.4 Worked Example: $L = \{0^n1^n \mid n \geq 0\}$

1. Assume $L$ is regular with pumping length $p$.
2. Choose $s = 0^p1^p \in L$. Clearly $|s| = 2p \geq p$.
3. The pumping lemma says we can split $s = xyz$ with $|xy| \leq p$ and $|y| \geq 1$. Since $|xy| \leq p$, both $x$ and $y$ consist only of 0s.
4. Let $y = 0^k$ for some $k \geq 1$.
5. Pump once: $xy^2z = x(0^k)(0^k)1^p = 0^{p+k}1^p$.
6. This string has more 0s than 1s → not in $L$.
7. Contradiction. Therefore $L$ is not regular. Tracing Table — Possible splits for p=3, s=000111: | Split | x | y | z | |y| | |xy| | xy²z | In L? | |-------|---|---|---|-----|------|------|-------| | 1 | ε | 0 | 00111 | 1 | 1 | 000111 | No (4 zeros, 3 ones) | | 2 | 0 | 0 | 0111 | 1 | 2 | 000111 | No (4 zeros, 3 ones) | | 3 | 00 | 0 | 111 | 1 | 3 | 000111 | No (4 zeros, 3 ones) | All possible splits produce $xy^2z \notin L$.

4. More Pumping Lemma Examples

4.1 Example 2: $L = \{ww^R \mid w \in \{0,1\}^*\}$

1. Assume $L$ is regular with pumping length $p$.
2. Choose $s = 0^p110^p \in L$ (this is $ww^R$ where $w = 0^p1$).
3. With $|xy| \leq p$, $y$ consists only of 0s: $y = 0^k$, $k \geq 1$.
4. $xy^2z = 0^{p+k}110^p$ — first part has more 0s than second part. This is not a palindrome → not in $L$.
5. Contradiction. $L$ is not regular.

4.2 Example 3: $L = \{a^n \mid n \text{ is prime}\}$

1. Assume $L$ is regular with pumping length $p$.
2. Choose $s = a^q$ where $q \geq p$ is prime.
3. Split $s = xyz$ where $y = a^k$, $k \geq 1$.
4. $xy^{q+1}z = a^{q + q\cdot k} = a^{q(1+k)}$.
5. Since $q(1+k)$ is composite ($q \cdot (1+k)$ where both factors $> 1$), $xy^{q+1}z \notin L$.
6. Contradiction. $L$ is not regular.

5. Common Pitfalls

Pitfall 1: Pumping the Wrong Direction

Pitfall 2: Choosing the Wrong String s

Pitfall 3: Forgetting $|xy| \leq p$

6. Key Concepts Reference

7. 📝 Practice Questions

Q1: Minimize a DFA with states {A,B,C} where A is initial, C is final. Transitions: δ(A,0)=B, δ(A,1)=C, δ(B,0)=B, δ(B,1)=C, δ(C,0)=C, δ(C,1)=C.

Answer:

Step 1: Mark (A,C) and (B,C) — C is final, A/B are not.

Step 2: Check (A,B):

• On 0: δ(A,0)=B, δ(B,0)=B → same state, OK
• On 1: δ(A,1)=C, δ(B,1)=C → same state, OK
• No marked pair found → A ≡ B

Result: Merge A and B. Minimized DFA has 2 states: {A,B} and {C}. Q2: Prove that L = {ww | w ∈ {0,1}*} is not regular using the pumping lemma.

Answer:

1. Assume L is regular with pumping length p.
2. Choose s = 0^p10^p1. This is ww where w = 0^p1 ∈ L.
3. |s| = 2p+2 ≥ p. With |xy| ≤ p, y consists only of 0s from the first block: y = 0^k, k ≥ 1.
4. Pump once: xy²z = 0^{p+k}10^p1.
5. The first half (before the middle) is 0^{p+k}1, the second half is 0^p1. These are different → not ww.
6. Contradiction. L is not regular. Q3: For L = {0^n1^m | n < m}, prove it's not regular.

Answer:

1. Assume L is regular with pumping length p.
2. Choose s = 0^p1^{p+1} ∈ L (n=p, m=p+1, so n < m).
3. With |xy| ≤ p, y consists only of 0s: y = 0^k, k ≥ 1.
4. Pump up: xy²z = 0^{p+k}1^{p+1}. Now n = p+k, m = p+1.
5. For k ≥ 1, p+k ≥ p+1, so n ≥ m. This violates n < m → xy²z ∉ L.
6. Contradiction. L is not regular. Q4: What are the Myhill-Nerode equivalence classes for L = {0^n1^0^n} (language of strings with equal 0s at both ends)?

Answer:

The equivalence classes are:

• C_0: Strings where we haven't seen a 1 yet (prefix of 0s)
• C_1: Strings that have seen a 1 (mid-section)
• C_reject: Strings that break the pattern

Since there are finitely many classes (3), L is regular. This is expected since this language is just 0_10_. Q5: Explain why the pumping lemma condition |xy| ≤ p is necessary.

Answer: The |xy| ≤ p condition comes from the pigeonhole principle: a DFA with p states processing p characters must visit at least p+1 states (starting state + p transitions). With only p states, by the pigeonhole principle, at least one state is visited twice. The first occurrence marks the start of the loop (x), the repeat marks the end of y. So xy ≤ p ensures the loop is completed within the first p characters. Without this condition, y might not correspond to a DFA loop. Q6: Can a non-regular language satisfy the pumping lemma? Why or why not?

Answer: Yes! The pumping lemma is a necessary but not sufficient condition for regularity. Some non-regular languages satisfy the pumping lemma. Example: L = {a^nb^m | n ≥ 1, m ≥ n} ∪ {a^nb^m | n ≥ 1, m = n²}. This language satisfies the pumping lemma but is not regular. This is why the pumping lemma can only prove non-regularity (by contradiction) — it cannot prove regularity. Q7: For a DFA with 5 states, what's the maximum possible number of distinguishable state pairs?

Answer: Total pairs = C(5,2) = 10. If all states are mutually distinguishable, all 10 pairs are marked. If some are equivalent (merged), fewer pairs are marked. The maximum is 10 (no equivalent states), giving a minimal DFA with 5 states. Q8: Use the pumping lemma to prove L = {0^i1^j0^k | i = j + k} is not regular.

Answer:

1. Assume L is regular with pumping length p.
2. Choose s = 0^{2p}1^p0^p ∈ L (i=2p, j=p, k=p, so i = j+k).
3. With |xy| ≤ p, y consists only of 0s: y = 0^m, m ≥ 1.
4. Pump up: xy²z = 0^{2p+m}1^p0^p. Now i = 2p+m, j = p, k = p.
5. j + k = p + p = 2p, but i = 2p+m > 2p. So i ≠ j+k → xy²z ∉ L.
6. Contradiction. L is not regular.

8. 🔗 Cross-References

• Week 1 - Finite Automata: DFA/NFA foundations
• Week 2 - Regular Expressions: Equivalence to DFAs
• Week 4 - Context-Free Grammars: Beyond regular languages
• BSCS4032 (Compiler Design): Lexical analysis, DFA minimization Join Discord PreviousRegex to DFANextContext-Free Grammars