GATE CS 2016 Set 2 — Question 27
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33EasyFinite Automata & Regular LanguagesTheory of ComputationContext-Free GrammarsContext-Free Languages
Theory of Computation → Context-Free Languages → Context-Free Grammars
Last updated
Question
Language is defined by the grammar:
Language is defined by the grammar: Consider the following statements:
: is regular
: is regularWhich one of the following is TRUE?
Language is defined by the grammar: Consider the following statements:
: is regular
: is regularWhich one of the following is TRUE?
Correct answer
(C) P is false and Q is true
Solution
Analyze the languages generated by the grammars:
1. (): This grammar generates strings of the form for . This is a classic example of a Context-Free Language (CFL) that is not regular because it requires infinite memory to match the count of 's and 's. Thus, statement is false.
2. (): This grammar generates strings of the form for . This can be represented by the regular expression . Since it can be represented by a regular expression, it is a regular language. Thus, statement is true.
Conclusion: is false and is true.Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Context-Free Languages
2026 Set 2 Q13Which one of the following statements is equivalent to the following assertion? Turing machine …2026 Set 1 Q25Consider the following grammar where is the start symbol, and and are terminal symbols.…2026 Set 1 Q26Let be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet. Which of…2026 Set 2 Q29Which of the following grammars is/are ambiguous?2026 Set 2 Q47Consider the following two finite automata and . [figure] Which of the following…