Computer Science · Theory of Computation
निम्नलिखित में से कौन सी भाषा एक रेगुलर लैंग्वेज (Regular language) नहीं है?
- 1L = {anbm | n ≥ 0, m ≥ 0}
- 2L = {ana3an | n ≥ 0}
- 3L = {anan+3 | n ≥ 0}
- 4L = {anbn+3 | n ≥ 0}✓
सही उत्तर देखें
L = {anbn+3 | n ≥ 0}
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!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
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