Question

Is a^i^2 | i>=1 regular?

score 292 · Answer 1 · 2024-12-05 14:00:08

292

Views

Is a^i^2 | i>=1 regular?

Published on 05 December 2024 at 14:00

score 152 · Answer 2 · 2024-12-08 00:07:52

152

Views

Relation of pumping lengths between related regular languages

Published on 08 December 2024 at 00:07

score 244 · Answer 3 · 2024-12-05 14:05:17

244

Views

Finding errors in pumping lemma conditions

Published on 05 December 2024 at 14:05

score 18.8k · Answer 4 · 2024-12-26 02:45:49

18.8k

Views

What exactly is the 'pumping length' in the Pumping lemma?

Published on 26 December 2024 at 02:45

score 774 · Answer 5 · 2024-12-05 14:03:52

774

Views

Did I apply pumping lemma correctly?

Published on 05 December 2024 at 14:03

score 1.7k · Answer 6 · 2025-01-02 23:42:44

1.7k

Views

Pumping lemma on regular languages?

Published on 02 January 2025 at 23:42

score 53 · Answer 7 · 2025-01-03 13:45:49

53

Views

Why pumping lemma for context free languages do not have bound on first part of string?

Published on 03 January 2025 at 13:45

score 2.1k · Answer 8 · 2024-12-07 23:31:10

2.1k

Views

Prove language irregular with pumping Lemma

Published on 07 December 2024 at 23:31

score 349 · Answer 9 · 2025-01-02 05:18:06

349

Views

Discrete Logarithm in Prolog

Published on 02 January 2025 at 05:18

score 1.2k · Answer 10 · 2024-12-05 14:02:52

1.2k

Views

Is L = {ww^Ru | w, u ∈ {0,1}+} regular language?

Published on 05 December 2024 at 14:02

score 7k · Answer 11 · 2024-12-09 09:53:14

7k

Views

To make sure: Pumping lemma for infinite regular languages only?

Published on 09 December 2024 at 09:53

score 294 · Answer 12 · 2024-12-23 01:56:16

294

Views

Pumping Lemma, Condition 1

Published on 23 December 2024 at 01:56

score 1.4k · Answer 13 · 2024-12-28 04:25:36

1.4k

Views

Is this the correct way to use the pumping lemma?

Published on 28 December 2024 at 04:25

score 1.1k · Answer 14 · 2024-12-30 18:30:07

1.1k

Views

Proving language is context-free with pumping lemma

Published on 30 December 2024 at 18:30

score 56 · Answer 15 · 2024-12-05 14:09:52

56

Views

Hard to pin non-regular language with pumping lemma

Published on 05 December 2024 at 14:09

score 9.2k · Answer 16 · 2024-12-05 14:12:59

9.2k

Views

Show that L ={ ww^R : w ∈ Σ*} is not regular by using Pumping Lemma

Published on 05 December 2024 at 14:12

score 214 · Answer 17 · 2024-12-05 14:15:24

214

Views

Using string of set length with pumping lemma to prove irregularity

Published on 05 December 2024 at 14:15

score 42 · Answer 18 · 2025-01-01 11:40:41

42

Views

Pumping Lemma and Hierachy

Published on 01 January 2025 at 11:40

score 2.8k · Answer 19 · 2024-12-05 14:00:13

2.8k

Views

Minimum Pumping Length

Published on 05 December 2024 at 14:00

score 358 · Answer 20 · 2024-12-05 14:02:51

358

Views

Why pumping lemma for CFG doesn't work

Published on 05 December 2024 at 14:02

List Question

Is a^i^2 | i>=1 regular?

Relation of pumping lengths between related regular languages

Finding errors in pumping lemma conditions

What exactly is the 'pumping length' in the Pumping lemma?

Did I apply pumping lemma correctly?

Pumping lemma on regular languages?

Why pumping lemma for context free languages do not have bound on first part of string?

Prove language irregular with pumping Lemma

Discrete Logarithm in Prolog

Is L = {ww^Ru | w, u ∈ {0,1}+} regular language?

To make sure: Pumping lemma for infinite regular languages only?

Pumping Lemma, Condition 1

Is this the correct way to use the pumping lemma?

Proving language is context-free with pumping lemma

Hard to pin non-regular language with pumping lemma

Show that L ={ ww^R : w ∈ Σ*} is not regular by using Pumping Lemma

Using string of set length with pumping lemma to prove irregularity

Pumping Lemma and Hierachy

Minimum Pumping Length

Why pumping lemma for CFG doesn't work

Trending Questions

Popular # Hahtags

Popular Questions