Question 84Asked in Bihar STET 2025 Paper II Computer Science, 7 Nov 2025, Shift 1 (9:00 AM) + 2 more papers

The language accepted by Push down Automaton:पुश डाउन ऑटोमेटन द्वारा स्वीकृत भाषा:

पुश डाउन ऑटोमेटन द्वारा स्वीकृत भाषा:
  1. ARecursive Languageपुनरावर्ती भाषा
  2. BContext free languageसंदर्भ मुक्त भाषा
  3. CLinearly Bounded languageरैखिक रूप से परिबद्ध भाषा
  4. DAll of the mentionedउल्लिखित सभी
Show answerHide answer

Correct answer: (B) Context free languageसंदर्भ मुक्त भाषा

Explanation

Pushdown automata accept exactly the context-free languages (Type 2). Linear bounded automata accept context-sensitive languages, and Turing machines accept recursive and RE languages.Pushdown automata ठीक context-free भाषाएँ (Type 2) स्वीकार करते हैं। Linear bounded automata context-sensitive भाषाएँ स्वीकार करते हैं, और Turing मशीनें recursive और RE भाषाएँ।

From Bihar STET 2025 Paper II Computer Science PYQ, 7 Nov 2025, Shift 1 (9:00 AM)

This is question 84 of Bihar STET 2025 Paper II Computer Science PYQ, 7 Nov 2025, Shift 1 (9:00 AM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.

Asked in 3 papers