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

The Gateway to Computer Science Excellence

0 votes

0

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

answer for this question is 3

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

0

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

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

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,384 answers

198,542 comments

105,341 users