Showing 0–0 of 0 results
# Exercise Title Features Description Platform Keywords
1 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
2 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
3 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
4 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
5 Regular Grammar Exercise: NFA conversion RegEx Writing Exercise User writes a regular grammar equivalent to a given NFA: Exercise 1. OpenDSA Non-Deterministic Finite Automata, Regular Grammar
6 Regular Grammar Exercise: NFA Conversion 2 Grammar Construction Exercise User writes a regular grammar equivalent to a given NFA: Exercise 2. OpenDSA Non-Deterministic Finite Automata, Regular Grammar
7 Regular Grammar Exercise: NFA Conversion to Right Regular Grammar Grammar Construction Exercise User writes a right regular grammar equivalent to a given NFA: Exercise 2. OpenDSA Non-Deterministic Finite Automata, Regular Grammar
8 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
9 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
10 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
11 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
12 Regular Grammars Introduction Frameset Programmed Instruction Programmed Instruction Frameset presenting an introduction to regular grammars, their definitions and properties. OpenDSA Regular Grammar, Regular Language
13 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
14 Regular Expression Exercise: Strings Containing aba RegEx Writing Exercise User writes an regular expression for the language of strings containing aba. OpenDSA Regular Expression
15 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
16 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
17 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
18 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
19 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
20 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
21 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
22 NFA Conversion to Regular Expression Example Programmed Instruction Programmed Instruction Frameset presenting an example of converting a NFA to an equivalent Regular Expression. OpenDSA Regular Expression, Non-Deterministic Finite Automata
23 Regular Expressions Equivalent to NFA: Part 1 Programmed Instruction Programmed Instruction Frameset presenting Part 1 of 4 parts of a proof of equivalence of Regular Expressions and NFAs. OpenDSA Regular Expression, Non-Deterministic Finite Automata
24 Regular Expressions Equivalent to NFA: Part 3: Concatenate Programmed Instruction Programmed Instruction Frameset presenting Part 3 of 4 parts of a proof of equivalence of Regular Expressions and NFAs. Concatenating... OpenDSA Regular Expression, Non-Deterministic Finite Automata
25 Regular Expressions Equivalent to NFA: Example Programmed Instruction Programmed Instruction Frameset presenting examples of converting a Regular Expression to an equivalend NFA. OpenDSA Regular Expression, Non-Deterministic Finite Automata
26 Regular Expressions Equivalent to NFA: Part 2: Or Programmed Instruction Programmed Instruction Frameset presenting Part 2 of 4 parts of a proof of equivalence of Regular Expressions and NFAs. Or'ing... OpenDSA Regular Expression, Non-Deterministic Finite Automata
27 Regular Expressions Equivalent to NFA: Part 4: Star Programmed Instruction Programmed Instruction Frameset presenting Part 4 of 4 parts of a proof of equivalence of Regular Expressions and NFAs. Kleene... OpenDSA Regular Expression, Non-Deterministic Finite Automata
28 Regular Expressions Introduction Frameset Programmed Instruction Programmed Instruction Frameset introducing Regular Expressions their formal definition. OpenDSA Regular Expression
29 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
30 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
31 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
32 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
33 Regular Expression to Minimized DFA Example Algorithm Visualization Visualization presenting examples of converting a Regular Expression to an equivalend NFA. OpenDSA Regular Expression, Non-Deterministic Finite Automata
34 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
35 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
36 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
37 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
38 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
39 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
40 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
41 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
42 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
43 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
44 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
45 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
46 Calculating the Employee's Wage Based on the Hours That the Employee Has Worked and an Hourly Pay Rate Construct a program for the payment department of a company to calculate the wage of an employee based on the... PCEX
47 Calculating the Wage of an Employee at the Customer Service Call Center Construct a program for the payment department of a company to calculate the wage of an employee who works at... PCEX
48 Calculating the Employees Wage Based on the Hours That the Employee Has Worked and an Hourly Pay Rate Construct a program for the payment department of a company to calculate the wage of an employee based on the... PCEX
49 Calculating the Wage of an Employee at the Customer Service Call Center Construct a program for the payment department of a company to calculate the wage of an employee who works at... PCEX
50 Calculating the Employee's Wage Based on the Hours That the Employee Has Worked and an Hourly Pay Rate Construct a program for the payment department of a company to calculate the wage of an employee based on the... PCEX
51 Calculating the Wage of an Employee at the Customer Service Call Center Construct a program for the payment department of a company to calculate the wage of an employee who works at... PCEX
52 Calculating the Employee's Wage Based on the Hours That the Employee Has Worked and an Hourly Pay Rate Construct a program for the payment department of a company to calculate the wage of an employee based on the... PCEX
53 Calculating the Wage of an Employee at the Customer Service Call Center. Construct a program for the payment department of a company to calculate the wage of an employee who works at... PCEX
54 Calculating the Employee's Wage Based on the Hours That the Employee Has Worked and an Hourly Pay Rate Construct a program for the payment department of a company to calculate the wage of an employee based on the... PCEX