List questions from pumping-lemma

Published on 20 Mar 2021 - 19:47

30

Views

Pumping Lemma to prove language not regular, formatting $x$

Published on 23 Feb 2026 - 6:19

1.6k

Views

Proof that the language $a^nb^ma^nb^m$ is not context free using the pumping lemma.

Published on 02 Apr 2021 - 23:38

98

Views

Can number of states of minimum accepting automaton be equal to a constan from the pumping lemma?

Published on 06 Apr 2021 - 22:01

274

Views

Prove the following languages are irregular.

Published on 13 Apr 2021 - 8:06

64

Views

Regularity of $w^{|w|}$

Published on 06 May 2021 - 14:39

473

Views

Check if the Language is context-free using the Pumping Lemma

Published on 03 Jun 2021 - 16:57

763

Views

Is $\{a^nb^mc^{n+m} \mid n, m \geqslant 0\}$ a context-free language (CFL)??

Published on 10 Jun 2021 - 0:30

154

Views

Use pumping-lemma to prove that L is not a context-free language

Published on 03 Jul 2021 - 14:35

74

Views

Pumping Lemma for regular languages

Published on 06 Sep 2021 - 18:23

115

Views

Is it true that for every regular language $L \subseteq \{0, 1\}^{*}$ the language $\{w^{|w|} |w \in L \}$ is also regular?

Published on 11 Oct 2021 - 20:59

3.8k

Views

Prove that L={$a^p$: p is prime } is not regular using pumping lemma

Published on 12 Nov 2021 - 9:25

39

Views

Proof of context free Language

Published on 20 Jan 2022 - 23:37

80

Views

How can the following language be regular?

Published on 21 Jan 2022 - 9:18

2k

Views

a^m b^n c^n prove it's not regular/pumping lemma

Published on 05 Mar 2022 - 9:48

List Question

Why doesn't $|uv|\le k$ break the pumping lemma?

Pumping Lemma to prove language not regular, formatting $x$

Proof that the language $a^nb^ma^nb^m$ is not context free using the pumping lemma.

Can number of states of minimum accepting automaton be equal to a constan from the pumping lemma?

Prove the following languages are irregular.

Regularity of $w^{|w|}$

Check if the Language is context-free using the Pumping Lemma

Is $\{a^nb^mc^{n+m} \mid n, m \geqslant 0\}$ a context-free language (CFL)??

Use pumping-lemma to prove that L is not a context-free language

Pumping Lemma for regular languages

Is it true that for every regular language $L \subseteq \{0, 1\}^{*}$ the language $\{w^{|w|} |w \in L \}$ is also regular?

Prove that L={$a^p$: p is prime } is not regular using pumping lemma

Proof of context free Language

How can the following language be regular?

a^m b^n c^n prove it's not regular/pumping lemma

Trending Questions

Popular # Hahtags

Popular Questions