The Gateway to Computer Science Excellence
0 votes
276 views

in Theory of Computation by Loyal (8.5k points) | 276 views
0

@ Sir, may you please explain this. I have read your answer on Pumping lemma in Gate 19 question!

0

@Shaik Masthan

Thanks Bhai. is minimum pumping length is equal to the number of states in minimal DFA?

0
my previous two comments were wrong... Forgot about them.

answer for this question is 3

 

and yes, it is equal to minimum number of states in minimal DFA
0

@Shaik Masthan

Are you sure, brother?

0
yes, i am sure !
0
Can you tell some more material to read and understand for finding minimum pumping length.

Thanks!
0

@Shaik Masthan I don’t think 3 is the minimum pumping length. 

See if you take string a^5 then if you take pumping length equals to 3 then you can’t split the string aaaaa into x, y and z part which satisfy 3 conditions of Pumping lemma for regular language.

0
consider any three consecutive a's as y
0
Yes bhai, you're right. Thanks again.
0

is minimum pumping length is equal to the number of states in minimal DFA?

the minimum pumping lenght should be less than or equal to states in minimal DFA.

https://gateoverflow.in/302833/gate2019-15

See the first fact in Deepak ponia's answer

Please log in or register to answer this question.

Related questions

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
50,737 questions
57,384 answers
198,542 comments
105,341 users