Computer Science · Theory of Computation
नियमित भाषाओं (regular languages) के लिए पंपिंग लेम्मा (Pumping Lemma) में, यदि भाषा के एक स्ट्रिंग w को xyz में इस प्रकार विभाजित किया जाता है कि |w| ≥ p हो, तो सबस्ट्रिंग 'y' के लिए आवश्यक न्यूनतम लंबाई क्या है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 10
- 21✓
- 32
- 4p
सही उत्तर देखें
1
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Theory of Computation MCQs →Want more practice questions on Theory of Computation?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Theory of Computation