Regular Pumping Lemma

\(L = \{a^nb^n \text{: } n \geq 0 \}\)

\(L = \{w \in \{a, b\}^*\text{: } n_a(w) < n_b(w)\}\)

\(L = \{ww^R \text{: } w \in \{a, b\}^*\}\)

\(L = \{(ab)^na^k \text{: } n > k, k \geq 0\}\)

\(L = \{a^nb^kc^{n+k} \text{: } n \geq 0, k \geq 0\}\)

\(L = \{a^nb^la^k \text{: } n > 5, l > 3, k \leq l\}\)

\(L = \{a^n \text{: n is even}\}\)

\(L = \{a^nb^k \text{: n is odd or k is even.}\}\)

\(L = \{bba(ba)^na^{n-1}\}\)

\(L = \{b^5w \text{: } w \in \{a, b\}^* \text{, } 2n_a(w) = 3n_b(w)\}\)

\(L = \{b^5w \text{: } w \in \{a, b\}^* \text{, } (2n_a(w) + 5n_b(w)) \text{ mod } 3 = 0\}\)

\(L = \{b^k(ab)^n(ba)^n \text{: } k \geq 4 \text{, } n = 1,2,...\}\)

\(L = \{(ab)^{2n} \text{: } n = 1,2,...\}\)

1. Select a lemma.
Pick a lemma L = (a^n)(b^n): n ≥ 0 L = {w ∈ {a, b}*: n_a(w) < n_b(w)} L = {ww^R: w ∈ {a, b}*} L = {((ab)^n)(a^k): n > k, k ≥ 0} L = {(a^n)(b^k)(c^(n+k)): n ≥ 0, k ≥ 0} L = {(a^n)(b^l)(a^k): n > 5, l > 3, k ≤ l} L = {a^n: n is even} L = {(a^n)(b^k): n is odd or k is even.} L = {bba((ba)^n)(a^(n-1))} L = {b^5w: w ∈ {a, b}*, 2n_a(w) = 3n_b(w)} L = {b^5w: w ∈ {a, b}*, (2n_a(w) + 5n_b(w)) mod 3 = 0} L = {(b^k)((ab)^n)((ba)^n): k ≥ 4, n = 1, 2...} L = {(ab)^(2n): n = 1, 2...}

2. Choose who makes the first move. Press "Enter" to continue.
You go first Computer goes first