| Title | Pumping Lemma Example: Harder Proof |
| Catalog Type | SLCItem |
| Persistent ID | https://opendsax.cs.vt.edu/OpenDSA/Metadata/inlineav/PIFLA/NonRegular/PLExampa3bncn3FS.html |
| Platform Name | OpenDSA |
| Features | Programmed Instruction, Proof Visualization |
| Description | Programmed Instruction slideshow showing the harder pumping lemma proof where there are multiple cases to consider. |
| Keywords | Non-Regular Language |
| Author | Mostafa Mohammed, Cliff Shaffer |
| Institution | Virginia Tech |
| Iframe URL | https://opendsax.cs.vt.edu/OpenDSA/Metadata/inlineav/PIFLA/NonRegular/PLExampa3bncn3FS.html |
| Protocol | LTI 1.1, SPLICE |
| Protocol URL | |
| License | https://github.com/OpenDSA/OpenDSA/blob/master/MIT-license.txt |
| Programming Language | N/A |
| Natural Language | en |