Title	Context-Free Language Pumping Lemma Example 3
Catalog Type	SLCItem
Persistent ID	https://opendsax.cs.vt.edu/OpenDSA/Metadata/inlineav/PIFLA/PDA/CFLPumpingEx3FS.html
Platform Name	OpenDSA
Features	Programmed Instruction
Description	Programmed Instruction slideshow giving an example for using a pumping lemma to prove a language is not Context-Free: a^j b^k with k = j^2.
Keywords	Context-Free Language , Pumping Lemma
Author	Mostafa Mohammed, Cliff Shaffer
Institution	Virginia Tech
Iframe URL	https://opendsax.cs.vt.edu/OpenDSA/Metadata/inlineav/PIFLA/PDA/CFLPumpingEx3FS.html
Protocol	LTI 1.1, SPLICE
Protocol URL	https://opendsax.cs.vt.edu/lti/launch?custom_ex_short_name=CFLPumpingEx3FS&custom_ex_settings=%7B%7D https://opendsax.cs.vt.edu/OpenDSA/Metadata/inlineav/PIFLA/PDA/CFLPumpingEx3FS.html
License	https://github.com/OpenDSA/OpenDSA/blob/master/MIT-license.txt
Programming Language	N/A
Natural Language	en

SPLICE Output