Computer Science · Theory of Computation
निम्नलिखित में से कौन सी भाषा संदर्भ-मुक्त (context-free) नहीं है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1L = {w | w में a और b की संख्या समान है}
- 2L = {w | w, {a, b} पर एक पलिंड्रोम है}
- 3L = {anbncn | n ≥ 0}✓
- 4L = {anbn | n ≥ 0}
सही उत्तर देखें
L = {anbncn | n ≥ 0}
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