Showing 0-0 of 0 results
# Exercise Title Features Description Platform Keywords
1 Decideable Questions about Regular Languages Programmed Instruction Programmed Instruction Frameset reviews the concept of decideablilty and presenting some key questions that are decideable for regular languages. OpenDSA Regular Language
2 Review of the Concept of Closure Properties Programmed Instruction Programmed Instruction Frameset reviewing the concept of closure properties, in the context of regular languages. OpenDSA Regular Language, Closure Property
3 Basic Closure Properties of Regular Languages Programmed Instruction Programmed Instruction Frameset presenting some basic operations that are closed for regular languages, like intersection. OpenDSA Regular Language, Closure Property
4 Closure Properties for Regular Languages: Right Quotient Programmed Instruction Programmed Instruction Frameset presenting the concept of right quotient, and a proof that this operator is closed for regular languages. OpenDSA Regular Language, Closure Property
5 Closure Properties for Regular Languages: Homomorphism Programmed Instruction Programmed Instruction Frameset presenting the concept of homomorphism, and a proof that this operator is closed for regular languages. OpenDSA Regular Language, Closure Property
6 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
7 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
8 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
9 Introduction to the Concept of a Non-Regular Language Programmed Instruction Programmed Instruction slideshow introducing the concept of a non-regular language and ideas for how to recognize one. OpenDSA Non-Regular Language
10 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
11 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
12 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
13 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
14 Right and Left Regular Grammars Frameset Programmed Instruction Programmed Instruction Frameset presenting right and left regular grammars and conversion between them. OpenDSA Regular Grammar, Regular Language
15 Converting NFAs to Regular Grammars Frameset Programmed Instruction Programmed Instruction Frameset presenting a conversion from a NFA to an equivalent regular grammar. OpenDSA Regular Grammar, Regular Language, Non-Deterministic Finite Automata
16 Converting a RegEx to a Left Regular Grammar Frameset Programmed Instruction Programmed Instruction Frameset presenting a conversion from a regular expression to a left regular grammar. OpenDSA Regular Grammar, Regular Language
17 Converting a RegEx to a Right Regular Grammar Frameset Programmed Instruction Programmed Instruction Frameset presenting a conversion from a regular expression to a right regular grammar. OpenDSA Regular Grammar, Regular Language
18 Regular Grammars Introduction Frameset Programmed Instruction Programmed Instruction Frameset presenting an introduction to regular grammars, their definitions and properties. OpenDSA Regular Grammar, Regular Language
19 Converting Regular Grammars to NFAs Frameset Programmed Instruction Programmed Instruction Frameset presenting a conversion from a regular grammar to an equivalent NFA. OpenDSA Regular Grammar, Regular Language, Non-Deterministic Finite Automata
20 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
21 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
22 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
23 Regular Expression Exercise: Strings Containing aba RegEx Writing Exercise User writes an regular expression for the language of strings containing aba. OpenDSA Regular Expression
24 Regular Expression Exercise: Strings of Multiples of 3 a's RegEx Writing Exercise User writes an regular expression for the language of strings that contain a multiple of 3 a's. OpenDSA Regular Expression
25 Regular Expression Exercise: Strings of a's Preceded or Followed by b RegEx Writing Exercise User writes an regular expression for the language of strings where every a is either proceeded or followed by b. OpenDSA Regular Expression
26 Regular Expression Exercise: Strings of 2 b's and c's RegEx Writing Exercise User writes an regular expression for the language of strings where the number of b's and c's sums to 2. OpenDSA Regular Expression
27 Regular Expression Exercise: Strings of Even Binary Numbers RegEx Writing Exercise User writes an regular expression for the language of strings that are even binary numbers. OpenDSA Regular Expression
28 Regular Grammar Exercise: aaab*ba Grammar Construction Exercise User writes an regular grammar for the language of strings matching the regular expression (aaab*ba)*. OpenDSA Regular Expression, Regular Grammar
29 Regular Grammar Exercise: a's a Multiple of 3 Grammar Construction Exercise User writes an regular grammar for the language of strings with the number of a's being divisible by 3. OpenDSA Regular Grammar
30 Regular Grammar Exercise: Number of a's and b's is Odd Grammar Construction Exercise User writes an regular grammar for the language of strings with an odd length. OpenDSA Regular Expression, Regular Grammar
31 Regular Grammar Exercise: bb*aaa* Grammar Construction Exercise User writes an regular grammar for the language of strings that meet this regular expression: bb*aaa* OpenDSA Regular Expression, Regular Grammar
32 Regular Expression Exercise: Strings Containing bba in an Even Position RegEx Writing Exercise User writes an regular expression for the langugae of strings containing bba in an even position. OpenDSA Regular Expression
33 Regular Expression Exercise: Strings Containing No aa RegEx Writing Exercise User writes an regular expression for the langugae of strings containing no occurance of aa. OpenDSA Regular Expression
34 Regular Expression Exercise: Strings Containing One bbb RegEx Writing Exercise User writes an regular expression for the langugae of strings containing exactly one instance of bbb. OpenDSA Regular Expression