menu
Recent questions tagged pumping-lemma
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged pumping-lemma
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged pumping-lemma
0
votes
0
answers
17
views
Gate applied
Can some one please do a pumping lema on L = {a^(2n+1) | n>=0 } I know Finite automata can be easily made and hence it is a regular language, but the pumping lema test fails for this implying it is a non-regular language (I am sure I am doing the pumping lema wrong) can someone please do a pumping lema for this so that I compare my solution and rectify my mistake
pavan.varyani
asked
in
Theory of Computation
Dec 7, 2021
by
pavan.varyani
5
points
17
views
toc-languages
regular-expressions
pumping-lemma
0
votes
0
answers
32
views
pumping lemma
@Praveen Saini @Lakshman Patel RJIT @Digvijay Pandey Just wanted to ask doubt, If the minimum pumping length of the language can be 0 for any language? I think it should not be as any string will either be accepted or rejected.
rish1602
asked
in
Theory of Computation
Jun 21, 2021
by
rish1602
9
points
32
views
pumping-lemma
pumping-length
theory-of-computation
self-doubt
1
vote
0
answers
31
views
Theory of computation - Pumping Lemma for CFL [Self Doubt]
hari0943
asked
in
Theory of Computation
May 12, 2021
by
hari0943
9
points
31
views
pumping-lemma
0
votes
0
answers
18
views
An introduction to formal languages and automata
How can I explain that this language- L= { a<sup>n</sup> b<sup>l</sup> : n ≠ l } is not regular. [USE PUMPING LEMMA OR CLOSURE PROPERTIES] This question is under a book named An introduction to ... understandable manner and show how you exactly arrived at the solution? That would be a great help to me. Thanks in advance
kirtipurohit
asked
in
Theory of Computation
Jan 18, 2021
by
kirtipurohit
15
points
18
views
toc-languages
peter-linz
grammar
dfas
pumping-lemma
0
votes
0
answers
23
views
TOC self doubt
How to prove L={a ^n^2:n≥0} is not context free using Pumping Lemma?
Pathki Shivamsh
asked
in
Theory of Computation
Sep 28, 2020
by
Pathki Shivamsh
9
points
23
views
pumping-lemma
0
votes
2
answers
114
views
Pumping Lemma, self doubt
Is it necessary for the CFL string lenghts to be in AP if the alphabet is a singleton set?
xiuhan
asked
in
Theory of Computation
Aug 21, 2020
by
xiuhan
13
points
114
views
pumping-lemma
theory-of-computation
self-doubt
1
vote
2
answers
73
views
Self Doubt Peter Linz 5th edition: Exercise 8.1, Q13 [CFL Pumping Lemma]
pritishc
asked
in
Theory of Computation
Aug 16, 2020
by
pritishc
27
points
73
views
pumping-lemma
context-free-languages
0
votes
0
answers
23
views
TOC(self doubt-classification into the language)
Came to read and also got to know as a shortcut about classification of a Language on the basis of the comparisons into CFL or CSL.Is it really the standard method or is it the short trick or just an ill-defined way of attempting a question. This post can be taken as a reference – https://gateoverflow.in/26952/%23toc
prajjwalsingh_11
asked
in
Theory of Computation
Jul 13, 2020
by
prajjwalsingh_11
15
points
23
views
theory-of-computation
pumping-lemma
context-free-languages
context-sensitive-languages
0
votes
0
answers
28
views
GATE2019-15 Video Solution
For $\Sigma = \{a ,b \}$, let us consider the regular language $L=\{x \mid x = a^{2+3k} \text{ or } x=b^{10+12k}, k \geq 0\}$. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for $L$ ? $3$ $5$ $9$ $24$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
581
points
28
views
gate2019
theory-of-computation
pumping-lemma
video-solution
0
votes
0
answers
19
views
GATE2005-IT-40 Video Solution
A language $L$ satisfies the Pumping Lemma for regular languages, and also the Pumping Lemma for context-free languages. Which of the following statements about $L$ is TRUE? $L$ is necessarily a regular language. $L$ is necessarily a context-free language, but not necessarily a regular language. $L$ is necessarily a non-regular language. None of the above
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
581
points
19
views
gate2005-it
theory-of-computation
pumping-lemma
easy
video-solution
To see more, click for the
full list of questions
or
popular tags
.
Ask
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts