Let , be Context Free Grammars (CFGs) and be a regular expression. For a grammar , let denote the language generated by .
Which ONE among the following questions is decidable?
- AIs ?
- BIs ?
- CIs ?
- DIs ?
Theory of Computation (TOC)Turing Machines & UndecidabilityMCQ1 mark · −1/3 if wrongMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.