Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Pumping Lemma Game | Proficiency Exercise | Demonstration of an adversary argument for the Pumping Lemma, in the form of an adversary game. | OpenDSA | Pumping Lemma, Regular Language, Adversary Argument |
| 2 | Pumping Lemma Example: Harder Proof | Programmed Instruction, Proof Visualization | Programmed Instruction slideshow showing the harder pumping lemma proof where there are multiple cases to consider. | OpenDSA | Non-Regular Language |
| 3 | Pumping Lemma Example: a^n b^n | Programmed Instruction, Proof Visualization | Programmed Instruction slideshow showing the pumping lemma proof that the language a^n b^n is not regular. | OpenDSA | Non-Regular Language |
| 4 | Pumping Lemma Example: wwR | Programmed Instruction, Proof Visualization | Programmed Instruction slideshow showing the pumping lemma proof that the language consisting of a string w followed by the reverse... | OpenDSA | Non-Regular Language |
| 5 | Pumping Lemma for Context-Free Languages | Programmed Instruction | Programmed Instruction slideshow introducing a pumping lemma for Context-Free Languages. | OpenDSA | Context-Free Language, Pumping Lemma |
| 6 | Introduction to the Pumping Lemma | Proof Visualization | Introduction to the Pumping Lemma for regular languages. Includes a visualization for how this works. | OpenDSA | Pumping Lemma, Non-Regular Language |
| 7 | Pumping Lemma Slideshow | Proof Visualization | Simple demonstration of a Pumping Lemma proof to show that a language is not regular. | OpenDSA | Pumping Lemma, Non-Regular Language |
| 8 | Context-Free Language Pumping Lemma Example 1 | Programmed Instruction | Programmed Instruction slideshow giving an example for using a pumping lemma to prove a language is not Context-Free: a^n b^n... | OpenDSA | Context-Free Language, Pumping Lemma |
| 9 | Context-Free Language Pumping Lemma Example 2 | Programmed Instruction | Programmed Instruction slideshow giving an example for using a pumping lemma to prove a language is not Context-Free: a^n b^n... | OpenDSA | Context-Free Language, Pumping Lemma |
| 10 | Context-Free Language Pumping Lemma Example 3 | Programmed Instruction | Programmed Instruction slideshow giving an example for using a pumping lemma to prove a language is not Context-Free: a^j b^k... | OpenDSA | Context-Free Language, Pumping Lemma |
| 11 | Context-Free Language Pumping Lemma Example 4 | Programmed Instruction | Programmed Instruction slideshow giving an example for using a pumping lemma to prove a language is not Context-Free: w, reverse... | OpenDSA | Context-Free Language, Pumping Lemma |
| 12 | Introduction to the Concept of the Pumping Lemma | Programmed Instruction | Programmed Instruction slideshow introducing the concept of a the pumping lemma for regular languages. | OpenDSA | Non-Regular Language |