Computer Science · Theory of Computation
Which of the following statements are correct? (i) A language is regular if and only if it can be represented by a regular expression. (ii) A language is regular if and only if it cannot be generated by a regular grammar. (iii) Every regular grammar is a context-free grammar.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(iii) only
- 2(i) and (iii) only✓
- 3(i) and (ii) only
- 4(i) only
Correct answer
(i) and (iii) 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