What is the general form of a context-sensitive grammar production rule?

Α1 A α2 → α1 β α2

True or False: Every context-sensitive language is also a context-free language.

True.

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?

Context-sensitive language

The Pumping Lemma for context-free languages allows us to prove that some languages are not context-free by demonstrating that ______.

Uv^i x y^i z ∉ L for some i

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}

D) {a^n b^n c^n | n ≥ 0}

Fill in the blank: The language generated by the grammar S → aAbc → abAc → abBbcc → aBbbcc is ______.

{a^n b^n c^n | n ≥ 1}

True or False: The intersection of two context-free languages is always context-free.

False. The intersection of two context-free languages need not be context-free.

In the context of context-free languages, if a language requires counting and comparing three or more variables independently, it is ______.

Not context-free

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?

Context-free language

What technique is used to show that certain languages are not regular?

Pumping Lemma