Computer Science · Theory of Computation
पुशडाउन ऑटोमेटा (PDA) द्वारा किस प्रकार की भाषा स्वीकार की जाती है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1नियमित भाषा (Regular Language)
- 2संदर्भ-संवेदनशील भाषा (Context-Sensitive Language)
- 3संदर्भ-मुक्त भाषा (Context-Free Language)✓
- 4रिकर्सिव भाषा (Recursive Language)
सही उत्तर देखें
संदर्भ-मुक्त भाषा (Context-Free Language)
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