Riddle: I am a language that can be generated by a context-sensitive grammar but cannot be described by a context-free grammar. What am I? | Card: 5 / 20 |
The Pumping Lemma for context-free languages allows us to prove that some languages are not context-free by demonstrating that ______. | Card: 7 / 20 |
Which of the following languages is not regular? A) {a^n b^n | n ≥ 0} B) {a^n b^m | n, m ≥ 0} C) {a^n b^(2n) | n ≥ 0} D) {a^n b^n c^n | n ≥ 0} | Card: 9 / 20 |
![]() Unlock all Flashcards with EduRev Infinity Plan Starting from @ ₹99 only |
Fill in the blank: The language generated by the grammar S → aAbc → abAc → abBbcc → aBbbcc is ______. | Card: 11 / 20 |
True or False: The intersection of two context-free languages is always context-free. | Card: 13 / 20 |
In the context of context-free languages, if a language requires counting and comparing three or more variables independently, it is ______. | Card: 15 / 20 |
Riddle: I can be generated by a grammar with rules that allow for substitutions, but I cannot be recognized by a finite automaton. What am I? | Card: 17 / 20 |






