Computer Science · Theory of Computation
According to the Chomsky hierarchy, which of the following corresponds to a Type-1 language or Type-1 grammar?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Unrestricted Grammar / Recursively Enumerable Language
- 2Context-Sensitive Grammar / Context-Sensitive Language✓
- 3Context-Free Grammar / Context-Free Language
- 4Regular Grammar / Regular Language
Correct answer
Context-Sensitive Grammar / Context-Sensitive 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