Question

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

score 87 · Answer 1 · 2026-04-29 12:46:02

87

Views

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

Published on 29 Apr 2026 - 12:46

score 3k · Answer 2 · 2026-04-29 12:46:10

3k

Views

How to calculate the minimum pumping length for some L?

Published on 29 Apr 2026 - 12:46

score 211 · Answer 3 · 2026-05-10 09:49:17

211

Views

Pumping lemma proof and minimum length

Published on 10 May 2026 - 9:49

score 262 · Answer 4 · 2026-05-02 08:42:59

262

Views

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

Published on 02 May 2026 - 8:42

score 45 · Answer 5 · 2026-04-29 05:50:51

45

Views

To show that language is not regular using pumping lemma

Published on 29 Apr 2026 - 5:50

score 111 · Answer 6 · 2026-05-05 16:25:24

111

Views

PL to prove a language is not regular

Published on 05 May 2026 - 16:25

score 267 · Answer 7 · 2026-05-05 08:34:59

267

Views

Proving language is not regular using pumping lemma

Published on 05 May 2026 - 8:34

score 194 · Answer 8 · 2026-05-02 01:09:22

194

Views

is a fractional i allowed in pumping lemma??

Published on 02 May 2026 - 1:09

score 295 · Answer 9 · 2026-05-05 16:25:56

295

Views

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

Published on 05 May 2026 - 16:25

score 266 · Answer 10 · 2026-05-02 12:26:22

266

Views

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

Published on 02 May 2026 - 12:26

score 62 · Answer 11 · 2026-05-10 09:34:04

62

Views

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

Published on 10 May 2026 - 9:34

score 183 · Answer 12 · 2026-04-22 19:00:57

183

Views

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

Published on 22 Apr 2026 - 19:00

score 75 · Answer 13 · 2026-04-23 22:17:22

75

Views

Language that is CFL by Odgen but not by pumping lemma

Published on 23 Apr 2026 - 22:17

score 297 · Answer 14 · 2026-04-23 04:35:55

297

Views

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

Published on 23 Apr 2026 - 4:35

score 312 · Answer 15 · 2026-04-24 20:30:33

312

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 24 Apr 2026 - 20:30

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