Let and be two languages over a finite alphabet, such that and are regular languages.
Which of the following statements is/are always true?
- Ais regular
- Bis regular
- Cis context free
- Dis context free
Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMSQ2 marksEasy
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.