Question: L1 = {w {a} * | w = a 2k with k 0} So the language L1 contains only words that consist of a number
L1 = {w {a}* | w = a2k with k 0} So the language L1 contains only words that consist of a number a that corresponds to a power of two. Example a, aa, aaaa, aaaaaaaa, etc.
L2 = {ai b2i | i 0}.
Prove or disprove that the languages shown are context-free languages. Use the pumping lemma to refute the claim.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
