Showing 0–0 of 0 results
# Exercise Title Features Description Platform Keywords
1 Proof that 3-SAT is NP-Complete Slideshow Proof Visualization Slideshow demonstrating that 3-Satisfiability is NP-Complete by a reduction from Satisfiability. OpenDSA Clique Problem
2 Closure Properties to Show a Language Non-Regular: Example 1 Programmed Instruction, Proof Visualization Programmed Instruction slideshow demonstrating an example of using closure properties to prove a language non-regular. Language: a^n b^m a^m. OpenDSA Non-Regular Language, Closure Property
3 Closure Properties to Show a Language Non-Regular: Example 2 Programmed Instruction, Proof Visualization Programmed Instruction slideshow demonstrating an example of using closure properties to prove a language non-regular. Example 2. OpenDSA Non-Regular Language, Closure Property
4 Closure Properties to Show a Language Non-Regular Programmed Instruction, Proof Visualization Programmed Instruction slideshow introducing the concept of using closure properties to prove a language non-regular. OpenDSA Non-Regular Language, Closure Property
5 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
6 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
7 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
8 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
9 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