Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged pumping-lemma
0
votes
0
answers
1
Pumping Lemma
If L = { x == y | where x and y are equal binary numbers} and Σ = {0, 1, =} How can I prove that L is not a regular language using pumping lemma and contradiction?
shallowfalcon
asked
in
Theory of Computation
Oct 17
by
shallowfalcon
52
views
theory-of-computation
pumping-lemma
regular-language
0
votes
1
answer
2
Self Doubt
$L=\{wa^nw^Rb^n\mid w\in \left \{ a,b \right \}^\ast ,n\geqslant 0\}$ Can anyone give me step by step solution that shows this is not CFL by pumping Lemma?
tusharb
asked
in
Theory of Computation
Jul 29
by
tusharb
157
views
self-doubt
theory-of-computation
pumping-lemma
1
vote
1
answer
3
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b} if yes then why please explain
sachin_27
asked
in
Theory of Computation
Jun 1
by
sachin_27
217
views
theory-of-computation
regular-language
pumping-lemma
context-free-language
0
votes
1
answer
4
pumping length - TOC
What is meant by ‘pumping length’ and how can we find it?
atulcse
asked
in
Theory of Computation
Jan 28
by
atulcse
249
views
theory-of-computation
pumping-lemma
2
votes
2
answers
5
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 12
The logic of pumping lemma is a good example of the pigeon-hole principle the divide and conquer technique recursion iteration
Lakshman Patel RJIT
asked
in
Theory of Computation
Apr 1, 2020
by
Lakshman Patel RJIT
503
views
nielit2017oct-assistanta-cs
theory-of-computation
pumping-lemma
1
vote
0
answers
6
Peter Linz Edition 4 Exercise 8.1 Question 8 (Page No. 212)
Determine whether or not the following languages are context-free. (a) $L=$ {$a^nww^Ra^n : n ≥ 0, w ∈$ {$a,b$}*} (b) $L=$ {$a^nb^ja^nb^j : n ≥ 0, j ≥ 0$}. (C) $L=$ {$a^nb^ja^jb^n : n ≥ 0, j ≥ 0$}. (d) $L=$ {$a^nb^ja^kb^l : n + j ≤ k + l$ ... $ L=$ {$a^nb^nc^j : n ≤j$}. (g) $L=$ {$w ∈$ {$a, b, c$}* $: n_a(w)= n_b (w)=2n_c(w)$}.
Naveen Kumar 3
asked
in
Theory of Computation
Jun 25, 2019
by
Naveen Kumar 3
542
views
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
pumping-lemma
proof
2
votes
0
answers
7
Peter Linz Edition 4 Exercise 8.1 Question 5 (Page No. 212)
Is the language L = {$a^nb^m : n = 2^m$} context-free?
Naveen Kumar 3
asked
in
Theory of Computation
Jun 25, 2019
by
Naveen Kumar 3
323
views
peter-linz
peter-linz-edition4
theory-of-computation
pumping-lemma
context-free-language
0
votes
2
answers
8
Peter Linz Edition 4 Exercise 8.1 Question 1 (Page No. 212)
Show that the language $L=${$a^nb^nc^m,n\neq m$} is not context-free.
Naveen Kumar 3
asked
in
Theory of Computation
Jun 25, 2019
by
Naveen Kumar 3
375
views
peter-linz
peter-linz-edition4
theory-of-computation
pumping-lemma
context-free-language
0
votes
0
answers
9
Michael Sipser Edition 3 Exercise 2 Question 37 (Page No. 158)
Prove the following stronger form of the pumping lemma, where in both pieces $v$ and $y$ must be nonempty when the string $s$ is broken up$.$If $A$ is a context-free language, then there is a number $k$ where, if $s$ is any string in $A$ of ... $i\geq 0,uv^{i}xy^{i}z\in A,$ $v\neq\epsilon$ and $y\neq\epsilon,$and $\mid vxy\mid\leq k.$
Lakshman Patel RJIT
asked
in
Theory of Computation
May 4, 2019
by
Lakshman Patel RJIT
309
views
michael-sipser
theory-of-computation
context-free-language
pumping-lemma
1
vote
1
answer
10
Michael Sipser Edition 3 Exercise 2 Question 36 (Page No. 158)
Give an example of a language that is not context free but that acts like a $CFL$ in the pumping lemma$.$ Prove that your example works$.$ $\text{(See the analogous example for regular languages in Question 54.)}$
Lakshman Patel RJIT
asked
in
Theory of Computation
May 4, 2019
by
Lakshman Patel RJIT
1.1k
views
michael-sipser
theory-of-computation
context-free-language
pumping-lemma
proof
0
votes
1
answer
11
Michael Sipser Edition 3 Exercise 2 Question 34 (Page No. 157)
Let $G = (V, \Sigma, R, S)$ be the following grammar. $V = \{S, T, U\}; \Sigma = \{0, \#\};$ and $R$ is the set of rules$:$ $S\rightarrow TT\mid U$ $T\rightarrow 0T\mid T0\mid \#$ ... existence of a pumping length $p$ for $B.$ What is the minimum value of $p$ that works in the pumping lemma$?$ Justify your answer$.$
Lakshman Patel RJIT
asked
in
Theory of Computation
May 4, 2019
by
Lakshman Patel RJIT
768
views
michael-sipser
theory-of-computation
context-free-language
pumping-lemma
proof
0
votes
1
answer
12
Michael Sipser Edition 3 Exercise 2 Question 30 (Page No. 157)
Use the pumping lemma to show that the following languages are not context free$.$ $\{0^{n}1^{n}0^{n}1^{n}\mid n\geq 0\}$ $\{0^{n}\#0^{2n}\#0^{3n}\mid n\geq 0\}$ $\{w\#t\mid w$ $\text{ is a substring of}$ $ t,$ $\text{where}$ ... $\text{each}$ $ t_{i}\in\{a,b\}^{*},$ $\text{and}$ $ t_{i}=t_{j}$ $\text{ for some}$ $ i\neq j\}$
Lakshman Patel RJIT
asked
in
Theory of Computation
May 4, 2019
by
Lakshman Patel RJIT
646
views
michael-sipser
theory-of-computation
context-free-language
pumping-lemma
1
vote
1
answer
13
Michael Sipser Edition 3 Exercise 1 Question 55 (Page No. 91)
The pumping lemma says that every regular language has a pumping length $p,$ such that every string in the language can be pumped if it has length $p$ or more. If $p$ is a pumping length for language $A,$ so is any length $p^{'}\geq p.$ The minimum pumping ... $\epsilon$ $1^{*}01^{*}01^{*}$ $10(11^{*}0)^{*}0$ $1011$ $\sum^{*}$
Lakshman Patel RJIT
asked
in
Theory of Computation
Apr 30, 2019
by
Lakshman Patel RJIT
1.4k
views
michael-sipser
theory-of-computation
regular-language
pumping-lemma
proof
descriptive
0
votes
1
answer
14
Michael Sipser Edition 3 Exercise 1 Question 54 (Page No. 91)
Consider the language $F=\{a^{i}b^{j}c^{k}|i,j,k\geq 0$ $\text{and if}$ $ i = 1$ $\text{then} $ $ j=k\}.$ Show that $F$ is not regular. Show that $F$ acts like a regular language in the pumping lemma. ... three conditions of the pumping lemma for this value of $p.$ Explain why parts $(a)$ and $(b)$ do not contradict the pumping lemma.
Lakshman Patel RJIT
asked
in
Theory of Computation
Apr 30, 2019
by
Lakshman Patel RJIT
536
views
michael-sipser
theory-of-computation
finite-automata
regular-language
pumping-lemma
proof
descriptive
0
votes
1
answer
15
Michael Sipser Edition 3 Exercise 1 Question 30 (Page No. 88)
Describe the error in the following $ $proof$"$ that $0^{*}1^{*}$ is not a regular language. $($An error must exist because $0^{*}1^{*}$ is regular.$)$ The proof is by contradiction. Assume that $0^{*}1^{*}$ is regular ... example $1.73$ shows that $s$ cannot be pumped. Thus you have a contradiction. So $0^{*}1^{*}$ is not regular.
Lakshman Patel RJIT
asked
in
Theory of Computation
Apr 22, 2019
by
Lakshman Patel RJIT
524
views
michael-sipser
theory-of-computation
finite-automata
pumping-lemma
proof
1
vote
1
answer
16
Michael Sipser Edition 3 Exercise 1 Question 29 (Page No. 88)
Use the pumping lemma to show that the following languages are not regular. $A_{1}=\{0^{n}1^{n}2^{n}|n\geq 0\}$ $A_{2}=\{www|w\in\{a,b\}^{*}\}$ $A_{3}=\{a^{{2}^{n}}|n\geq 0\}$ $\text{(Here,}$\text{$a^{{2}^{n}}$}$ $\text{means a strings of $2^{n}$ a's.)}$
Lakshman Patel RJIT
asked
in
Theory of Computation
Apr 22, 2019
by
Lakshman Patel RJIT
979
views
michael-sipser
theory-of-computation
finite-automata
regular-language
pumping-lemma
0
votes
1
answer
17
Self doubt:Pumping Lemma
How by Pumping Lemma we can prove that “context free grammar generate an infinite number of strings” and here what could be pumping length ?
srestha
asked
in
Theory of Computation
Apr 19, 2019
by
srestha
463
views
theory-of-computation
pumping-lemma
0
votes
0
answers
18
Peter Linz Edition 5 Exercise 8.1 Question 7(k) (Page No. 212)
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free $L = \{a^nb^m: \text{n is prime and m is not prime}\}$.
Rishi yadav
asked
in
Theory of Computation
Apr 15, 2019
by
Rishi yadav
184
views
peter-linz
peter-linz-edition5
theory-of-computation
pumping-lemma
proof
context-free-language
0
votes
0
answers
19
Peter Linz Edition 5 Exercise 8.1 Question 7(j) (Page No. 212)
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free $L = \{a^nb^m:\text{n is prime or m is prime}\}$.
Rishi yadav
asked
in
Theory of Computation
Apr 15, 2019
by
Rishi yadav
147
views
peter-linz
peter-linz-edition5
theory-of-computation
pumping-lemma
proof
context-free-language
0
votes
0
answers
20
Peter Linz Edition 5 Exercise 8.1 Question 7(i) (Page No. 212)
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free $L = \{a^nb^m: \text{n and m are both prime}\}$.
Rishi yadav
asked
in
Theory of Computation
Apr 15, 2019
by
Rishi yadav
128
views
peter-linz
peter-linz-edition5
theory-of-computation
pumping-lemma
proof
context-free-language
0
votes
0
answers
21
Peter Linz Edition 5 Exercise 8.1 Question 7(h) (Page No. 212)
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free. $L = \{w\in\{a,b,c\}^*:n_a(w)+n_b(w)=2n_c(w),n_a(w) = n_b(w)\}$.
Rishi yadav
asked
in
Theory of Computation
Apr 15, 2019
by
Rishi yadav
181
views
peter-linz
peter-linz-edition5
theory-of-computation
pumping-lemma
proof
context-free-language
0
votes
0
answers
22
Peter Linz Edition 5 Exercise 8.1 Question 7(g) (Page No. 212)
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free. $L=\{w:n_a(w)/n_b(w) = n_c(w)\}$.
Rishi yadav
asked
in
Theory of Computation
Apr 15, 2019
by
Rishi yadav
119
views
peter-linz
peter-linz-edition5
theory-of-computation
pumping-lemma
proof
context-free-language
0
votes
0
answers
23
Peter Linz Edition 5 Exercise 8.1 Question 7(f) (Page No. 212)
Show that the following languages on $\Sigma = \{a,b,c\}$ are not context-free. $L = \{w:n_a(w) <n_b(w)<n_c(w)\}$.
Rishi yadav
asked
in
Theory of Computation
Apr 15, 2019
by
Rishi yadav
140
views
peter-linz
peter-linz-edition5
theory-of-computation
pumping-lemma
proof
context-free-language
Page:
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged pumping-lemma
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...