Question

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

score 251 · Answer 1 · 2013-12-13 22:32:35

251

Views

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

Published on 13 December 2013 at 22:32

score 118 · Answer 2 · 2017-08-29 11:26:38

118

Views

Relation of pumping lengths between related regular languages

Published on 29 August 2017 at 11:26

score 210 · Answer 3 · 2011-02-06 22:19:04

210

Views

Finding errors in pumping lemma conditions

Published on 06 February 2011 at 22:19

score 18.8k · Answer 4 · 2013-08-24 22:44:40

18.8k

Views

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

Published on 24 August 2013 at 22:44

score 739 · Answer 5 · 2013-08-25 09:02:51

739

Views

Did I apply pumping lemma correctly?

Published on 25 August 2013 at 09:02

score 1.7k · Answer 6 · 2014-01-09 02:57:55

1.7k

Views

Pumping lemma on regular languages?

Published on 09 January 2014 at 02:57

score 13 · Answer 7 · 2023-10-17 00:10:55

13

Views

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

Published on 17 October 2023 at 00:10

score 2.1k · Answer 8 · 2011-10-18 16:42:46

2.1k

Views

Prove language irregular with pumping Lemma

Published on 18 October 2011 at 16:42

score 303 · Answer 9 · 2020-12-08 22:57:48

303

Views

Discrete Logarithm in Prolog

Published on 08 December 2020 at 22:57

score 1.1k · Answer 10 · 2021-04-24 12:39:21

1.1k

Views

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

Published on 24 April 2021 at 12:39

score 7k · Answer 11 · 2012-08-06 16:36:37

7k

Views

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

Published on 06 August 2012 at 16:36

score 285 · Answer 12 · 2012-10-19 00:42:01

285

Views

Pumping Lemma, Condition 1

Published on 19 October 2012 at 00:42

score 1.4k · Answer 13 · 2014-01-26 02:26:05

1.4k

Views

Is this the correct way to use the pumping lemma?

Published on 26 January 2014 at 02:26

score 1.1k · Answer 14 · 2016-02-13 06:32:50

1.1k

Views

Proving language is context-free with pumping lemma

Published on 13 February 2016 at 06:32

score 48 · Answer 15 · 2016-02-25 23:42:45

48

Views

Hard to pin non-regular language with pumping lemma

Published on 25 February 2016 at 23:42

score 9.2k · Answer 16 · 2016-02-27 23:13:15

9.2k

Views

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

Published on 27 February 2016 at 23:13

score 209 · Answer 17 · 2022-12-29 20:29:57

209

Views

Using string of set length with pumping lemma to prove irregularity

Published on 29 December 2022 at 20:29

score 29 · Answer 18 · 2023-01-06 20:38:45

29

Views

Pumping Lemma and Hierachy

Published on 06 January 2023 at 20:38

score 2.8k · Answer 19 · 2016-01-29 15:08:30

2.8k

Views

Minimum Pumping Length

Published on 29 January 2016 at 15:08

score 353 · Answer 20 · 2016-02-01 00:02:24

353

Views

Why pumping lemma for CFG doesn't work

Published on 01 February 2016 at 00: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