Computer Science · Theory of Computation
Consider the following statements: A. A context-free language is generated by an LR(0) grammar if and only if it is accepted by a deterministic pushdown automaton and has the prefix property. B. If M1 is a single-tape Turing Machine simulating a multi-tape Turing Machine M, then the time taken by M1 to simulate n moves is O(n3). C. A pushdown automaton behaves like a Turing machine when it has one auxiliary memory. D. L = {anbncn : n ≥ 1} is not context-free but context-sensitive. Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A, B and C only
- 2A and B only
- 3A and D only✓
- 4B and C only
Correct answer
A and D only
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