Question

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

score 70 · Answer 1 · 2023-10-17T00:10:55.637000

70

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 65 · Answer 2 · 2023-07-12T10:19:12.753000

65

Views

Recognize the type of the given formal language

Published on 12 July 2023 at 10:19

score 78 · Answer 3 · 2023-04-26T00:41:15.820000

78

Views

concatenation of a context-free language

Published on 26 April 2023 at 00:41

score 74 · Answer 4 · 2023-01-06T20:38:45.733000

74

Views

Pumping Lemma and Hierachy

Published on 06 January 2023 at 20:38

score 258 · Answer 5 · 2022-12-29T20:29:57.517000

258

Views

Using string of set length with pumping lemma to prove irregularity

Published on 29 December 2022 at 20:29

score 176 · Answer 6 · 2022-09-19T07:17:49.130000

176

Views

Can someone help me with this proof about the pumping lemma using coq?

Published on 19 September 2022 at 07:17

score 385 · Answer 7 · 2022-08-30T18:14:56.283000

385

Views

Why is L = {a^ib^i , 0<i<5} regular?

Published on 30 August 2022 at 18:14

score 996 · Answer 8 · 2021-10-25T14:20:37.363000

996

Views

Is L = {a^n a^n b^m |m, n ≥ 0} a regular or irregular language?

Published on 25 October 2021 at 14:20

score 378 · Answer 9 · 2021-10-05T06:02:24.700000

378

Views

Proving if a language is context free with pumping lemma

Published on 05 October 2021 at 06:02

score 1.2k · Answer 10 · 2021-04-24T12:39:21.327000

1.2k

Views

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

Published on 24 April 2021 at 12:39

score 64 · Answer 11 · 2021-04-12T12:06:54.443000

64

Views

Regular language demonstration

Published on 12 April 2021 at 12:06

score 859 · Answer 12 · 2021-03-31T03:42:10.427000

859

Views

How to prove a language with (ab)^n.. is not regular with pumping lemma?

Published on 31 March 2021 at 03:42

score 35 · Answer 13 · 2021-03-23T21:18:06.697000

35

Views

How to translate this description into a language?

Published on 23 March 2021 at 21:18

score 825 · Answer 14 · 2021-03-10T03:52:57.813000

825

Views

How to prove that L = {a^j b^k c^k d^k: j, k ≥ 1} ∪ {b^j c^k d^l : j, k, l ≥ 0} satisfies the pumping lemma for CFL’s?

Published on 10 March 2021 at 03:52

score 65 · Answer 15 · 2021-02-27T07:03:13.430000

65

Views

Operating on a Regular Expression before applying Pumping Lemma

Published on 27 February 2021 at 07:03

score 269 · Answer 16 · 2021-01-09T15:39:02.907000

269

Views

Show is not regular with pumping lemma

Published on 09 January 2021 at 15:39

score 381 · Answer 17 · 2020-12-08T22:57:48.397000

381

Views

Discrete Logarithm in Prolog

Published on 08 December 2020 at 22:57

score 75 · Answer 18 · 2020-11-14T16:14:04.263000

75

Views

Why do we use pumping lemma to prove the non-regularity of languages? WHY?

Published on 14 November 2020 at 16:14

score 34 · Answer 19 · 2020-06-25T22:34:18.093000

34

Views

How to read language definition syntax for regular/nonregular languages

Published on 25 June 2020 at 22:34

score 596 · Answer 20 · 2020-05-30T18:05:52.107000

596

Views

Use the pumping lemma to show that the following languages are not regular languages L = {anbm | n = 2m}

Published on 30 May 2020 at 18:05

List Question

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

Recognize the type of the given formal language

concatenation of a context-free language

Pumping Lemma and Hierachy

Using string of set length with pumping lemma to prove irregularity

Can someone help me with this proof about the pumping lemma using coq?

Why is L = {a^ib^i , 0<i<5} regular?

Is L = {a^n a^n b^m |m, n ≥ 0} a regular or irregular language?

Proving if a language is context free with pumping lemma

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

Regular language demonstration

How to prove a language with (ab)^n.. is not regular with pumping lemma?

How to translate this description into a language?

How to prove that L = {a^j b^k c^k d^k: j, k ≥ 1} ∪ {b^j c^k d^l : j, k, l ≥ 0} satisfies the pumping lemma for CFL’s?

Operating on a Regular Expression before applying Pumping Lemma

Show is not regular with pumping lemma

Discrete Logarithm in Prolog

Why do we use pumping lemma to prove the non-regularity of languages? WHY?

How to read language definition syntax for regular/nonregular languages

Use the pumping lemma to show that the following languages are not regular languages L = {anbm | n = 2m}

Trending Questions

Popular # Hahtags

Popular Questions