Question

Union of two non-regular languages.

score 13.1k · Answer 1 · 2017-04-05 08:11:08

13.1k

Views

Union of two non-regular languages.

Published on 05 Apr 2017 - 8:11

score 1.5k · Answer 2 · 2017-04-08 22:02:32

1.5k

Views

The Language {xx}, of any string followed by another copy of the same string, is not Context Free. Using Pumping Lemma, through 13 cases.

Published on 08 Apr 2017 - 22:02

score 62 · Answer 3 · 2023-03-08 04:28:13

62

Views

Determining whether a given language is regular

Published on 08 Mar 2023 - 4:28

score 103 · Answer 4 · 2023-03-13 19:45:11

103

Views

Use the pumping lemma to show that following language is not context-free

Published on 13 Mar 2023 - 19:45

score 2.4k · Answer 5 · 2023-03-22 00:20:57

2.4k

Views

Using pumping lemma show that language $L = \{a^{n^2} | n≥ 0\}$ is not regular.

Published on 22 Mar 2023 - 0:20

score 37 · Answer 6 · 2023-05-04 12:34:06

37

Views

Using CFL pumping lemma to show that a language is not context free

Published on 04 May 2023 - 12:34

score 74 · Answer 7 · 2023-05-28 15:42:03

74

Views

Proof that $L =$ {$a^p : \text{p is prime} $} is not regular

Published on 28 May 2023 - 15:42

score 47 · Answer 8 · 2023-06-04 18:52:39

47

Views

Find the mistakes(pumping lemma proof). Can you help me?

Published on 04 Jun 2023 - 18:52

score 28 · Answer 9 · 2023-06-21 09:07:58

28

Views

I want to prove the pumping lemma for context-free languages but instead of using Chomsky's form using a new form.

Published on 21 Jun 2023 - 9:07

score 32 · Answer 10 · 2023-10-22 01:01:36

32

Views

Prove a class of regular languages is not closed under a weird concatenation operation

Published on 22 Oct 2023 - 1:01

score 56 · Answer 11 · 2023-10-26 22:38:14

56

Views

$L=\{0^m1^n \mid3m\leq 2n\}$ via pumping lemma

Published on 26 Oct 2023 - 22:38

score 279 · Answer 12 · 2023-11-23 21:07:31

279

Views

Proving that a language whose strings have prime length is not context-free

Published on 23 Nov 2023 - 21:07

score 58 · Answer 13 · 2024-02-11 11:55:27

58

Views

Is the Language $L=\{(ab)^{3n}\:|\:n\in\mathbb N\}$ regular?

Published on 11 Feb 2024 - 11:55

score 83 · Answer 14 · 2024-03-02 06:09:32

83

Views

Does pumping lemma ever fail?

Published on 02 Mar 2024 - 6:09

score 634 · Answer 15 · 2015-11-15 19:24:14

634

Views

Understanding the proof that uses Pumping Lemma that the language $C =\{w \mid w$ has an equal number of $0$'s and $1$'s$\}$ is not regular

Published on 15 Nov 2015 - 19:24

List Question

Union of two non-regular languages.

The Language {xx}, of any string followed by another copy of the same string, is not Context Free. Using Pumping Lemma, through 13 cases.

Determining whether a given language is regular

Use the pumping lemma to show that following language is not context-free

Using pumping lemma show that language $L = \{a^{n^2} | n≥ 0\}$ is not regular.

Using CFL pumping lemma to show that a language is not context free

Proof that $L =$ {$a^p : \text{p is prime} $} is not regular

Find the mistakes(pumping lemma proof). Can you help me?

I want to prove the pumping lemma for context-free languages but instead of using Chomsky's form using a new form.

Prove a class of regular languages is not closed under a weird concatenation operation

$L=\{0^m1^n \mid3m\leq 2n\}$ via pumping lemma

Proving that a language whose strings have prime length is not context-free

Is the Language $L=\{(ab)^{3n}\:|\:n\in\mathbb N\}$ regular?

Does pumping lemma ever fail?

Understanding the proof that uses Pumping Lemma that the language $C =\{w \mid w$ has an equal number of $0$'s and $1$'s$\}$ is not regular

Trending Questions

Popular # Hahtags

Popular Questions