Question

Given language, say if it is regular, context-free and proove it.

score 77 · Answer 1 · 2026-03-20 02:48:42

77

Views

Given language, say if it is regular, context-free and proove it.

Published on 20 Mar 2026 - 2:48

score 3k · Answer 2 · 2026-03-23 07:01:21

3k

Views

How to calculate the minimum pumping length for some L?

Published on 23 Mar 2026 - 7:01

score 205 · Answer 3 · 2026-03-22 17:31:07

205

Views

Pumping lemma proof and minimum length

Published on 22 Mar 2026 - 17:31

score 256 · Answer 4 · 2026-03-22 22:25:35

256

Views

Pumping lemma for $L=\{a^{p}b^{q} ∣ 0 ≤ p ≤ q\}$

Published on 22 Mar 2026 - 22:25

score 41 · Answer 5 · 2026-03-22 21:12:03

41

Views

To show that language is not regular using pumping lemma

Published on 22 Mar 2026 - 21:12

score 101 · Answer 6 · 2026-03-23 12:07:03

101

Views

PL to prove a language is not regular

Published on 23 Mar 2026 - 12:07

score 260 · Answer 7 · 2026-03-23 05:48:27

260

Views

Proving language is not regular using pumping lemma

Published on 23 Mar 2026 - 5:48

score 189 · Answer 8 · 2026-03-22 21:41:16

189

Views

is a fractional i allowed in pumping lemma??

Published on 22 Mar 2026 - 21:41

score 289 · Answer 9 · 2026-03-22 16:09:14

289

Views

Proving that $L=\{xww^r\mid x,w \in \{0,1\}^+\}$ is not regular

Published on 22 Mar 2026 - 16:09

score 261 · Answer 10 · 2026-03-22 16:35:10

261

Views

Pumping lemma: Convert pumped, binary string $xy^iz$to integer

Published on 22 Mar 2026 - 16:35

score 55 · Answer 11 · 2026-03-22 17:29:57

55

Views

$A= \{w \in \{a, b\}^∗ \mid \text{length of $a \leqslant 5$ and length of $b \leqslant 20$}\}$

Published on 22 Mar 2026 - 17:29

score 179 · Answer 12 · 2026-03-22 14:14:15

179

Views

i really don't know how to get $s = xyz$ for pumping lemma for this language

Published on 22 Mar 2026 - 14:14

score 71 · Answer 13 · 2026-03-22 15:18:19

71

Views

Language that is CFL by Odgen but not by pumping lemma

Published on 22 Mar 2026 - 15:18

score 285 · Answer 14 · 2026-03-22 10:22:31

285

Views

Simply starred language. $\left\{(ab)^n:n\in\mathbb{N}\right\}$ it is regular?

Published on 22 Mar 2026 - 10:22

score 304 · Answer 15 · 2026-03-22 03:29:50

304

Views

If $A$ is not a regular language and $B$ is a regular language and $B \neq \varnothing$, does $AB$ is not regular language?

Published on 22 Mar 2026 - 3:29

List Question

Given language, say if it is regular, context-free and proove it.

How to calculate the minimum pumping length for some L?

Pumping lemma proof and minimum length

Pumping lemma for $L=\{a^{p}b^{q} ∣ 0 ≤ p ≤ q\}$

To show that language is not regular using pumping lemma

PL to prove a language is not regular

Proving language is not regular using pumping lemma

is a fractional i allowed in pumping lemma??

Proving that $L=\{xww^r\mid x,w \in \{0,1\}^+\}$ is not regular

Pumping lemma: Convert pumped, binary string $xy^iz$to integer

$A= \{w \in \{a, b\}^∗ \mid \text{length of $a \leqslant 5$ and length of $b \leqslant 20$}\}$

i really don't know how to get $s = xyz$ for pumping lemma for this language

Language that is CFL by Odgen but not by pumping lemma

Simply starred language. $\left\{(ab)^n:n\in\mathbb{N}\right\}$ it is regular?

If $A$ is not a regular language and $B$ is a regular language and $B \neq \varnothing$, does $AB$ is not regular language?

Trending Questions

Popular # Hahtags

Popular Questions