Question

Prove language of $0^n1^m$ is irregular for coprime $n,m$.

score 842 · Answer 1 · 2026-04-09 13:38:27

842

Views

Prove language of $0^n1^m$ is irregular for coprime $n,m$.

Published on 09 Apr 2026 - 13:38

score 298 · Answer 2 · 2026-04-12 04:25:16

298

Views

How to prove that a language is non-regular by using Pumping lemma with length?

Published on 12 Apr 2026 - 4:25

score 70 · Answer 3 · 2026-05-10 15:09:50

70

Views

Proof for pumping lemma for new kind of CFL

Published on 10 May 2026 - 15:09

score 1.2k · Answer 4 · 2026-04-14 17:53:20

1.2k

Views

How to prove that the language L={w1#w2#. . .#wk: k ≥ 2, each wi ∈ {0,1}^* , and wi = wj for some i !=j} is not context free using the pumping lemma?

Published on 14 Apr 2026 - 17:53

score 163 · Answer 5 · 2026-04-15 04:10:36

163

Views

How to use the pumping lemma to prove that $a^{m}b^{n}a^{m}c^n$ is not context free?

Published on 15 Apr 2026 - 4:10

score 90 · Answer 6 · 2026-04-13 17:01:40

90

Views

Using the pumping lemma to deduce that the language consisting of palindromes is not regular

Published on 13 Apr 2026 - 17:01

score 1.1k · Answer 7 · 2026-04-14 18:13:00

1.1k

Views

Formally proving that $\{ L = { {a^i}{b^j}{c^k}, j = \min(i,k), i, k > 0\} } $ is context-free

Published on 14 Apr 2026 - 18:13

score 1.5k · Answer 8 · 2026-05-10 12:11:20

1.5k

Views

What does w ∈ a, b* mean?

Published on 10 May 2026 - 12:11

score 244 · Answer 9 · 2026-04-14 21:07:12

244

Views

Pumping Lemma for CF language exercise

Published on 14 Apr 2026 - 21:07

score 172 · Answer 10 · 2026-04-09 22:29:28

172

Views

negating propositional formula with quantifiers

Published on 09 Apr 2026 - 22:29

score 109 · Answer 11 · 2026-04-13 20:50:24

109

Views

I find difficulties in proving that $L=\{a^k b^{3l} c^l | l>=0, k>0\}$ is not a regular language.

Published on 13 Apr 2026 - 20:50

score 2k · Answer 12 · 2026-04-12 22:32:00

2k

Views

Can I prove, using Pumping Lemma, that $L=\{ a^i b^j a^j b^k | i,j,k \ge 1 \}$ is not a regular language?

Published on 12 Apr 2026 - 22:32

score 1.5k · Answer 13 · 2026-05-10 10:08:37

1.5k

Views

pumping lemma with prime

Published on 10 May 2026 - 10:08

score 363 · Answer 14 · 2026-04-12 11:51:00

363

Views

Pumping Lemma problem solved, but explanation appreciated. (Finite automata)

Published on 12 Apr 2026 - 11:51

score 82 · Answer 15 · 2026-04-14 01:27:05

82

Views

Prove that the language is nonregular using the Pumping Lemma:

Published on 14 Apr 2026 - 1:27

List Question

Prove language of $0^n1^m$ is irregular for coprime $n,m$.

How to prove that a language is non-regular by using Pumping lemma with length?

Proof for pumping lemma for new kind of CFL

How to prove that the language L={w1#w2#. . .#wk: k ≥ 2, each wi ∈ {0,1}^* , and wi = wj for some i !=j} is not context free using the pumping lemma?

How to use the pumping lemma to prove that $a^{m}b^{n}a^{m}c^n$ is not context free?

Using the pumping lemma to deduce that the language consisting of palindromes is not regular

Formally proving that $\{ L = { {a^i}{b^j}{c^k}, j = \min(i,k), i, k > 0\} } $ is context-free

What does w ∈ a, b* mean?

Pumping Lemma for CF language exercise

negating propositional formula with quantifiers

I find difficulties in proving that $L=\{a^k b^{3l} c^l | l>=0, k>0\}$ is not a regular language.

Can I prove, using Pumping Lemma, that $L=\{ a^i b^j a^j b^k | i,j,k \ge 1 \}$ is not a regular language?

pumping lemma with prime

Pumping Lemma problem solved, but explanation appreciated. (Finite automata)

Prove that the language is nonregular using the Pumping Lemma:

Trending Questions

Popular # Hahtags

Popular Questions