Showing 0–0 of 0 results
# Exercise Title Features Description Platform Keywords
1 Equivalence Relations Review Programmed Instruction Programmed Instruction Frameset presentation of equivalence relations review. OpenDSA Set
2 Programmed Instruction: Induction Proof For Factorial Programmed Instruction Programmed Instruction Frameset examples of induction proof proving a Factorial function implementation correct. OpenDSA Proof by Induction
3 Programmed Instruction: Induction Proof Examples Programmed Instruction Programmed Instruction Frameset examples of induction proofs. OpenDSA Proof by Induction
4 Programmed Instruction: Induction Proofs Programmed Instruction Programmed Instruction Frameset review of induction proofs. OpenDSA Induction Proof
5 Programmed Instruction: Induction Proof For Two Coloring Programmed Instruction Programmed Instruction Frameset examples of induction proof for two-coloring the 2D plane. OpenDSA Proof by Induction
6 Programmed Instruction: Proof Techniques Introduction Programmed Instruction Programmed Instruction Frameset presentation of basic proofs review, including proof by contradiction review. OpenDSA Proof
7 Relations Review Programmed Instruction Programmed Instruction Frameset presentation of basic relations terminology review. OpenDSA Set
8 Set Definitions Review Programmed Instruction Programmed Instruction Frameset presentation of basic set definitions and terminology review. OpenDSA Set
9 Set Notation Review Programmed Instruction Programmed Instruction Frameset presentation of basic set notation review. OpenDSA Set
10 Context-Free Language Ambiguity Frameset Programmed Instruction Programmed Instruction Frameset discussing ambiguity in Context-Free Grammars. OpenDSA Context-Free Grammar
11 Context-Free Language Derivations Frameset Programmed Instruction Programmed Instruction Frameset discussing derivations of strings from Context-Free Grammars. OpenDSA Context-Free Language
12 Context-Free Language Introduction Frameset Programmed Instruction Programmed Instruction Frameset introducing Context-Free Languages and their formal definition. OpenDSA Context-Free Language
13 Context-Free Grammar Transformation: Chomsky Normal Form Frameset Programmed Instruction Programmed Instruction Frameset discussing Chomsky Normal Form for Context-Free Grammars. OpenDSA Context-Free Grammar
14 Context-Free Language Derivation Trees Frameset Programmed Instruction Programmed Instruction Frameset discussing derivation trees for Context-Free Grammars. OpenDSA Context-Free Language
15 Context-Free Grammar Transformation: Greibach Normal Form Frameset Programmed Instruction Programmed Instruction Frameset discussing Greibach Normal Form for Context-Free Grammars. OpenDSA Context-Free Grammar
16 Context-Free Language Membership Problem Frameset Programmed Instruction Programmed Instruction Frameset discussing how to recognize if a given string is derivable from a given Context-Free Grammar. OpenDSA Context-Free Language
17 Context-Free Grammar Transformation: Remove Lambda Productions Frameset Programmed Instruction Programmed Instruction Frameset discussing removing lambda productions from Context-Free Grammars. OpenDSA Context-Free Grammar
18 Context-Free Grammar Transformation: Remove Unit Productions Frameset Programmed Instruction Programmed Instruction Frameset discussing removing unit productions from Context-Free Grammars. OpenDSA Context-Free Grammar
19 Context-Free Grammar Transformation: Useless Productions Frameset Programmed Instruction Programmed Instruction Frameset discussing removing useless productions from Context-Free Grammars. OpenDSA Context-Free Grammar
20 Context-Free Grammar Transformation Introduction Frameset Programmed Instruction Programmed Instruction Frameset discussing reasons for transforming Context-Free Grammars to simpler versions. OpenDSA Context-Free Grammar
21 Programmed Instruction: DFA Advanced Concepts Programmed Instruction Programmed Instruction Frameset covering more advanced DFA concepts. OpenDSA Deterministic Finite Automata
22 Programmed Instruction: DFA Definitions Programmed Instruction Programmed Instruction Frameset covering the formal definition of a DFA. OpenDSA Deterministic Finite Automata
23 Programmed Instruction: DFA Minimization Example 1 Programmed Instruction Programmed Instruction Frameset presenting the algorithm to minimize the number of states in a DFA: Example 1. OpenDSA Deterministic Finite Automata
24 Programmed Instruction: DFA Minimization Example 2 Programmed Instruction Programmed Instruction Frameset presenting the algorithm to minimize the number of states in a DFA: Example 2. OpenDSA Deterministic Finite Automata
25 Programmed Instruction: DFA Minimization Programmed Instruction Programmed Instruction Frameset presenting the algorithm to minimize the number of states in a DFA. OpenDSA Deterministic Finite Automata
26 Programmed Instruction: NFA to DFA Conversion Programmed Instruction Programmed Instruction Frameset with an example for converting an NFA to an equivalent DFA. OpenDSA Deterministic Finite Automata
27 Programmed Instruction: Non-Deterministic Finite Automata Programmed Instruction Programmed Instruction Frameset introducing the concept of non-determinism and the NFA. OpenDSA Deterministic Finite Automata
28 Introduction to the Concept of a Grammar Programmed Instruction Programmed Instruction slideshow introducing the concept of a grammar. OpenDSA Grammar
29 Introduction to the Concept of a Language Programmed Instruction Programmed Instruction slideshow introducing the concept of a language. OpenDSA Language
30 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
31 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
32 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
33 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
34 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
35 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
36 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
37 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
38 Closure Properties for Context-Free Languages Programmed Instruction Programmed Instruction slideshow explaining the concept and giving examples of closure properties for Context-Free Languages. OpenDSA Context-Free Language, Closure Property
39 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
40 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
41 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
42 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
43 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
44 Deterministic vs Nondeterministic PDAs Programmed Instruction Programmed Instruction Frameset discussing the differences between deterministic and non-deterministic PDAs. OpenDSA Pushdown Automata
45 Grammars for Deterministic CFL Programmed Instruction Programmed Instruction Frameset discussing grammars for deterministic context free languages. OpenDSA Context-Free Language
46 Proof not all CFL are Deterministic Programmed Instruction Programmed Instruction Frameset with a proof that there exists a CFL that is not a deterministic CFL. OpenDSA Pushdown Automata
47 Pushdown Automata Acceptance Models Frameset Programmed Instruction Programmed Instruction Frameset discussing Pushdown Automata acceptance models. OpenDSA Pushdown Automata
48 Pushdown Automata Acceptance Model Equivalence Frameset Programmed Instruction Programmed Instruction Frameset discussing the equivalence of various Pushdown Automata acceptance models. OpenDSA Pushdown Automata
49 Pushdown Automata and Context Free Languages Programmed Instruction Programmed Instruction Frameset discussing the relationship between Pushdown Automata and context free languages. OpenDSA Pushdown Automata
50 Pushdown Automata Empty Stack Acceptance Frameset Programmed Instruction Programmed Instruction Frameset discussing Pushdown Automata and the empty stack acceptance model. OpenDSA Pushdown Automata
51 Pushdown Automata Introduction Frameset Programmed Instruction Programmed Instruction Frameset introducing Pushdown Automata and their formal definition. OpenDSA Pushdown Automata
52 Pushdown Automata Transitions Frameset Programmed Instruction Programmed Instruction Frameset discussing Pushdown Automata transition types. OpenDSA Pushdown Automata
53 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
54 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
55 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
56 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
57 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
58 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
59 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
60 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
61 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
62 Regular Expressions Introduction Frameset Programmed Instruction Programmed Instruction Frameset introducing Regular Expressions their formal definition. OpenDSA Regular Expression
63 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
64 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
65 Regular Grammars Introduction Frameset Programmed Instruction Programmed Instruction Frameset presenting an introduction to regular grammars, their definitions and properties. OpenDSA Regular Grammar, Regular Language
66 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
67 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
68 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
69 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
70 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
71 Composition of Turing Machines Programmed Instruction Slideshow the formal conepts that support composition of Turing machines, which is a necessary step to building more complicated machines. OpenDSA Turing Machine
72 Turing Machines Deciding vs. Accepting Frameset Programmed Instruction Slideshow presenting the distinction between a Turing Machine that decides a language (always halts with a decision) vs. one that... OpenDSA Turing Machine
73 Turing Machines Introduction Frameset Programmed Instruction Slideshow introducing the concept of a Turing machine and its formal definition. OpenDSA Collision Resolution
74 Turing Machines Configurations and Terminology Frameset Programmed Instruction Slideshow presenting the concept of a configuration for a Turing machine, along with defintions for terms like halting, accepting, and... OpenDSA Collision Resolution