Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Introduction to the Concept of a Language | Programmed Instruction | Programmed Instruction slideshow introducing the concept of a language. | OpenDSA | Language |
| 2 | Characterizing Languages Exercise 1: Alternate | Question | Exercise on how to characterize the strings in the language for a given grammar on a's and b's. Alternate version. | OpenDSA | Language, Grammar |
| 3 | Characterizing Languages Exercise 2: Alternate | Question | Users characterize the strings in the language for a given grammar on palindromes. | OpenDSA | Language, Grammar |
| 4 | Language from CFG Exercise: Alternate | Question, Battery | A collection of self-practice questions where users select a language description for a given CFG. Alternate version. | OpenDSA | Context-Free Grammar |
| 5 | Characterizing Languages Exercise 1 | Question | Exercise on how to characterize the strings in the language for a given grammar on a's and b's. | OpenDSA | Language, Grammar |
| 6 | Characterizing Languages Exercise 2 | Question | Exercise on how to characterize the strings in the language for a given grammar on palindromes. | OpenDSA | Language, Grammar |
| 7 | Language from CFG Exercise | Question | Users select a language description for a given CFG. | OpenDSA | Context-Free Grammar |
| 8 | 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 |
| 9 | 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 |
| 10 | 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 |
| 11 | 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 |
| 12 | Context-Free Language Ambiguity Frameset | Programmed Instruction | Programmed Instruction Frameset discussing ambiguity in Context-Free Grammars. | OpenDSA | Context-Free Grammar |
| 13 | Context-Free Language Derivations Frameset | Programmed Instruction | Programmed Instruction Frameset discussing derivations of strings from Context-Free Grammars. | OpenDSA | Context-Free Language |
| 14 | Context-Free Language Introduction Frameset | Programmed Instruction | Programmed Instruction Frameset introducing Context-Free Languages and their formal definition. | OpenDSA | Context-Free Language |
| 15 | Context-Free Language Derivation Trees Frameset | Programmed Instruction | Programmed Instruction Frameset discussing derivation trees for Context-Free Grammars. | OpenDSA | Context-Free Language |
| 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 Language Derivation Trees Example | Algorithm Visualization | Visualization of a derviation tree from a given context-free grammar. | OpenDSA | Context-Free Language |
| 18 | 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 |
| 19 | 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 |
| 20 | 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 |
| 21 | 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 |
| 22 | 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 |
| 23 | 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 |
| 24 | 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 |
| 25 | 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 |
| 26 | 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 |
| 27 | 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 |
| 28 | Pushdown Automata and Context Free Languages | Programmed Instruction | Programmed Instruction Frameset discussing the relationship between Pushdown Automata and context free languages. | OpenDSA | Pushdown Automata |
| 29 | Grammar Construction Exercise: Three Strings | Grammar Construction Exercise | Exercise where user must write the grammar for a given language. This language has three strings. | OpenDSA | Language, Grammar |
| 30 | Grammar Construction Exercise: abb | Grammar Construction Exercise | Exercise where user must write the grammar for a given language. This language has some a's followed by twice as... | OpenDSA | Language, Grammar |
| 31 | Grammar Construction Exercise: a's and b's | Grammar Construction Exercise | Exercise where user must write the grammar for a given language. This language has some a's followed by some b's. | OpenDSA | Language, Grammar |
| 32 | Grammar Construction Exercise: Palendrome | Grammar Construction Exercise | Exercise where user must write the grammar for a given language. This language is palendromes on a's and b's. | OpenDSA | Language, Grammar |
| 33 | Grammar Construction Exercise: Balanced Parentheses | Grammar Construction Exercise | Exercise where user must write the grammar for a given language. This language has balanced and properly nested parentheses. | OpenDSA | Language, Grammar |
| 34 | 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 |
| 35 | 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 |
| 36 | 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 |
| 37 | 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 |
| 38 | 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 |
| 39 | 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 |
| 40 | Grammars for Deterministic CFL | Programmed Instruction | Programmed Instruction Frameset discussing grammars for deterministic context free languages. | OpenDSA | Context-Free Language |
| 41 | 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 |
| 42 | 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 |
| 43 | 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 |
| 44 | 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 |
| 45 | Regular Grammars Introduction Frameset | Programmed Instruction | Programmed Instruction Frameset presenting an introduction to regular grammars, their definitions and properties. | OpenDSA | Regular Grammar, Regular Language |
| 46 | 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 |
| 47 | Unambiguous CFG Parse Tree Example | Algorithm Visualization | Visualization for the parse tree generated for a mathematical expression from a non-ambiguouse CFG. | OpenDSA | Context-Free Language, Parse Tree |
| 48 | 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 |
| 49 | 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 |
| 50 | Regular Expression Exercise: Strings Containing aba | RegEx Writing Exercise | User writes an regular expression for the language of strings containing aba. | OpenDSA | Regular Expression |
| 51 | 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 |
| 52 | 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 |
| 53 | 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 |
| 54 | 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 |
| 55 | 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 |
| 56 | 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 |
| 57 | 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 |
| 58 | 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 |
| 59 | Functional Programming: Closures | Algorithm Visualization, Code Tracing Presentation | Slideshow illustrating closures in a functional programming language. | OpenDSA | Functional Programming |
| 60 | Functional Programming: Currying | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing currying in a functional programming language. | OpenDSA | Functional Programming |
| 61 | Functional Programming Exercise: Functional Composition | Tracing Exercise | A question related to functional programming languages: functional composition. | OpenDSA | Functional Programming |
| 62 | Functional Programming: Continuation Passing Style 1 | Question | A question related to functional programming languages: Continuation Passing Style. | OpenDSA | Functional Programming |
| 63 | Functional Programming: Continuation Passing Style 2 | Question | A question related to functional programming languages: Continuation Passing Style. | OpenDSA | Functional Programming |
| 64 | Functional Programming: Continuation Passing Style 3 | Question | A third question related to functional programming languages: Continuation Passing Style. | OpenDSA | Functional Programming |
| 65 | Functional Programming: Continuation Passing Style 4 | Question | A fourth question related to functional programming languages: Continuation Passing Style. | OpenDSA | Functional Programming |
| 66 | Functional Programming: Curry 1 | Question | A question related to functional programming languages: curry 1. | OpenDSA | Functional Programming |
| 67 | Functional Programming: Filter | Question | A question related to functional programming languages: filter pattern. | OpenDSA | Functional Programming |
| 68 | Functional Programming: Higher Order Functions 1 | Tracing Exercise | A question related to functional programming languages: higher order functions. | OpenDSA | Functional Programming |
| 69 | Functional Programming: Higher Order Functions 2 | Tracing Exercise | A question related to functional programming languages: higher order functions. | OpenDSA | Functional Programming |
| 70 | Functional Programming: Higher Order Functions 3 | Tracing Exercise | A question related to functional programming languages: higher order functions. | OpenDSA | Functional Programming |
| 71 | Functional Programming Exercise: Mapping Pattern | Tracing Exercise | A question related to functional programming languages: mapping pattern. | OpenDSA | Functional Programming |
| 72 | Functional Programming: Map Reduce | Question | A question related to functional programming languages: map reduce. | OpenDSA | Functional Programming |
| 73 | Functional Programming: Reduce 1 | Question | A question related to functional programming languages: reduce pattern. | OpenDSA | Functional Programming |
| 74 | Functional Programming: Reduce and Map | Question | A question related to functional programming languages: reduce and map pattern. | OpenDSA | Functional Programming |
| 75 | Functional Programming Exercise: Static vs Dynamic Binding | Tracing Exercise | A question related to functional programming languages: static vs. dynamic binding. | OpenDSA | Functional Programming |
| 76 | Functional Programming: Tail Recursion | Question | Question related to functional programming languages: tail recursion. | OpenDSA | Functional Programming |
| 77 | (Arrays) Grade scores - CSEdPad | This program stores the grades of 10 students in the Natural Language Processing class. Then, the program calculates the highest... | AnnEx | arrays | |
| 78 | CFG Exercise: a^mb^ia^n, i=m+n | Grammar Construction Exercise | User creates a CFG that generates strings in the language a^mb^ia^n, i=m+n. | OpenDSA | Context-Free Grammar |
| 79 | CFG Exercise: a^mb^ic^n, i less than 3 | Grammar Construction Exercise | User creates a CFG that generates strings in the language a^mb^ic^n, i < 3. | OpenDSA | Context-Free Grammar |
| 80 | CFG Exercise: Odd length | Grammar Construction Exercise | User creates a CFG that generates strings in the language a^nb^m where m - n is positive, odd. | OpenDSA | Context-Free Grammar |
| 81 | CFG Exercise: a's and b's are equal | Grammar Construction Exercise | User creates a CFG that generates strings in the language where the number of a's and b's is equal. | OpenDSA | Context-Free Grammar |
| 82 | Turing Machine Exercise: More a's | Automata Construction Exercise | User creates a Turing machine that recognizes the language with more a's than b's or c's. | OpenDSA | Turing Machine |
| 83 | Turing Machine Exercise: Palindromes | Automata Construction Exercise | User creates a Turing machine that recognizes the language of palindromes on strings of a's and b's. | OpenDSA | Turing Machine |
| 84 | Abstract Syntax of SLang1 | Question | Question related to the abstract syntax of functional programming language SLang1. | OpenDSA | Functional Programming |
| 85 | Curry in SLang1 | Question | Question related to curry in the functional programming language SLang1. | OpenDSA | Functional Programming |
| 86 | Recursive Tree Processing: Value Summation | Tracing Exercise | A question related to tree processing in a functional programming language: Value summation. | OpenDSA | Functional Programming |
| 87 | Recursive Tree Processing: Substitution | Question | A question related to tree processing in a functional programming language: Substitution. | OpenDSA | Functional Programming |
| 88 | Recursive Tree Processing: Substitution 2 | Question | A question related to tree processing in a functional programming language: Substitution 2. | OpenDSA | Functional Programming |
| 89 | Nested Lets | Tracing Exercise | Code trace exercise for a program in imperative language SLang2. | OpenDSA | Functional Programming |
| 90 | Nested Lets with Closures | Tracing Exercise | Code trace exercise for a program in imperative language SLang2. | OpenDSA | Functional Programming |
| 91 | Nested Lets Syntax-Only | Tracing Exercise | Code trace exercise for a program in imperative language SLang2. | OpenDSA | Functional Programming |
| 92 | Output of an SLang2 Program | Tracing Exercise | Code trace for a recursive program in imperative language SLang2. | OpenDSA | Functional Programming |
| 93 | Recursive List Processing 1 | Question | A question related to list processing in a functional programming language. | OpenDSA | Functional Programming |
| 94 | Recursive List Processing 2 | Question | A question related to list processing in a functional programming language. | OpenDSA | Functional Programming |
| 95 | Recursive List Processing 3 | Question | A question related to list processing in a functional programming language. | OpenDSA | Functional Programming |
| 96 | Semantics of SLang1 | Question | Question related to the semantics of the functional programming language SLang1. | OpenDSA | Functional Programming |
| 97 | Efficient Recursion in SLang2 | Tracing Exercise | Code trace for a recursive program in imperative language SLang2. | OpenDSA | Functional Programming |
| 98 | 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 |
| 99 | Functional Programming List Processing: Summation | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing basic list processing in a functional programming language: Summation of list values. | OpenDSA | Functional Programming |
| 100 | Functional Programming List Processing: isMember | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing basic list processing in a functional programming language: isMember function. | OpenDSA | Functional Programming |
| 101 | Functional Programming List Processing: Substitution | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing basic list processing in a functional programming language: substitution function. | OpenDSA | Functional Programming |
| 102 | Functional Programming Recursion: Summing Elements in a Tree | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing list-of-list (tree) processing in a functional programming language: sum all values. | OpenDSA | Functional Programming |
| 103 | Functional Programming Recursion: BST | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing list-of-list (tree) processing in a functional programming language: Binary Search Tree Search. | OpenDSA | Functional Programming |
| 104 | Functional Programming: Split and Join | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing split and join operations in a functional programming language. | OpenDSA | Functional Programming |
| 105 | Functional Programming: Scope and Closure | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing scope and closure in a functional programming language. | OpenDSA | Functional Programming |
| 106 | Functional Programming: Variable Hoisting | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing variable hoisting in a functional programming language. | OpenDSA | Functional Programming |
| 107 | Functional Programming: Nested Scopes | Algorithm Visualization, Code Tracing Presentation | Slideshow illustrating nested scopes in a functional programming language. | OpenDSA | Functional Programming |
| 108 | Functional Programming Visualization: Static vs Dynamic Binding | Algorithm Visualization, Code Tracing Presentation | Slideshow illustrating static vs dynamic binding in a functional programming language. | OpenDSA | Functional Programming |
| 109 | Functional Programming Visualization: Mapping Pattern | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing the mapping pattern in a functional programming language. | OpenDSA | Functional Programming |
| 110 | Functional Programming Visualization: Functional Composition | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing functional composition in a functional programming language. | OpenDSA | Functional Programming |
| 111 | Functional Programming: Filter Pattern | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing the filter pattern in a functional programming language. | OpenDSA | Functional Programming |
| 112 | Functional Programming: Reduce/Folding Pattern | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing the reduce/folding pattern in a functional programming language. | OpenDSA | Functional Programming |
| 113 | Functional Programming: ReduceRight Pattern | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing the reduceRight pattern in a functional programming language. | OpenDSA | Functional Programming |
| 114 | Functional Programming: MapReduce Pattern | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing the Map/Reduce pattern in a functional programming language. | OpenDSA | Functional Programming |
| 115 | Functional Programming: Continuation Passing | Algorithm Visualization, Code Tracing Presentation | Slideshow illustrating continuation passing in a functional programming language. | OpenDSA | Functional Programming |
| 116 | DFA Example Trace: Even Binary Numbers | Algorithm Visualization, Code Tracing Presentation | Visualization of how a DFA would process input strings for the language of even binary numbers. | OpenDSA | Deterministic Finite Automata |
| 117 | Functional Programming: Curry 2 | Question, Battery | A collection of self-practice questions related to functional programming languages: curry 2. | OpenDSA | Functional Programming |
| 118 | Functional Programming: Reduce 2 | Question, Battery | A collection of self-practice questions related to functional programming languages: reduce pattern. | OpenDSA | Functional Programming |
| 119 | Concrete Syntax of SLang1 | Question, Battery | A collection of self-practice questions related to the syntax of functional programming language SLang1. | OpenDSA | Functional Programming |
| 120 | Concrete Syntax of SLang1: 2 | Question, Battery | A second collection of self-practice questions related to the syntax of functional programming language SLang1. | OpenDSA | Functional Programming |
| 121 | Recursive Tree Processing: Mystery Function | Tracing Exercise, Battery | A collection of self-practice questions related to tree processing in a functional programming language: Mystery Function. | OpenDSA | Functional Programming |
| 122 | Expression Evaluation for SLang1 | Calculation Exercise, Battery | A collection of self-practice questions related to expression evaluation for the functional programming language SLang1. | OpenDSA | Functional Programming |
| 123 | Denoted Values in SLang1 | Question, Battery | A collection of self-practice questions related to denoted values in the functional programming language SLang1. | OpenDSA | Functional Programming |
| 124 | Split anad Join with Accumulators | Tracing Exercise | A question related to split and join operations with accumulators in a functional programming language. | OpenDSA | Functional Programming |
| 125 | Parameter Passing by Copy-Restore vs Macro vs Name | Tracing Exercise | A collection of self-practice questions to compare parameter passing by copy-restore vs macro vs name in language SLang2. | OpenDSA | Parameter Passing |
| 126 | Parameter Passing by Reference vs Copy-Restore vs Macro | Tracing Exercise | A collection of self-practice questions to compare parameter passing by reference vs copy-restore vs macro in language SLang2. | OpenDSA | Parameter Passing |
| 127 | Parameter Passing by Value vs Reference Exercise | Tracing Exercise | A collection of self-practice questions to compare parameter passing by value vs passing by reference in language SLang2. | OpenDSA | Parameter Passing |
| 128 | Parameter Passing by Value vs Reference Exercise vs Copy-Restore | Tracing Exercise | A collection of self-practice questions to compare parameter passing by value vs passing by reference vs copy-restore in language SLang2. | OpenDSA | Parameter Passing |
| 129 | Determine Values Bound to a Variable in Environment | Calculation Exercise, Battery | A collection of self-practice questions related to determining values bound to a variable in environment of the functional programming language... | OpenDSA | Functional Programming |
| 130 | DFA Exercise: Both Even or Odd | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with both even a's and b's, or both odd a's... | OpenDSA | Deterministic Finite Automata |
| 131 | DFA Exercise: b Surrounds a | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings where every a is surrounded by b's. | OpenDSA | Deterministic Finite Automata |
| 132 | DFA Exercise: Compliment of No 3 a's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings of a's and b's that have 3 consecutive a's. | OpenDSA | Deterministic Finite Automata |
| 133 | DFA Exercise: Divisible by 4 | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings of binary numbers divisible by 4. | OpenDSA | Deterministic Finite Automata |
| 134 | DFA Exercise: Even a's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an even number of a's. | OpenDSA | Deterministic Finite Automata |
| 135 | DFA Exercise: Even a's, b's, odd a's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an even number of a's, followed by at least... | OpenDSA | Deterministic Finite Automata |
| 136 | DFA Exercise: Even a, 3 b's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an even number of a's and at least 3... | OpenDSA | Deterministic Finite Automata |
| 137 | DFA Exercise: Even a's Odd b's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an even number of a's and an odd number... | OpenDSA | Deterministic Finite Automata |
| 138 | DFA Exercise: Even Binary Numbers | Automata Construction Exercise | User creates a DFA that accepts the langugage of even binary numbers. | OpenDSA | Deterministic Finite Automata |
| 139 | DFA Exercise: No 3 a's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings of a's and b's without 3 consecutive a's. | OpenDSA | Deterministic Finite Automata |
| 140 | DFA Exercise: No ba | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with a's and b's that does not end in ba. | OpenDSA | Deterministic Finite Automata |
| 141 | DFA Exercise: Odd a's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an odd number of a's. | OpenDSA | Deterministic Finite Automata |
| 142 | DFA Exercise: Odd a's, 3 b's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an odd number of a's and at most 3... | OpenDSA | Deterministic Finite Automata |
| 143 | DFA Exercise: Odd a's, Even b's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an odd number of a's and an even number... | OpenDSA | Deterministic Finite Automata |
| 144 | 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 |
| 145 | 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 |
| 146 | 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 |
| 147 | DFA Exercise: Complement Even a, 3 b's | Automata Construction Exercise | User creates a DFA that accepts the complement of the langugage of strings with an even number of a's and... | OpenDSA | Deterministic Finite Automata |
| 148 | DFA Exercise: Complement No ba | Automata Construction Exercise | User creates a DFA that accepts the complement of the langugage of strings with a's and b's that does not... | OpenDSA | Deterministic Finite Automata |
| 149 | PDA Exercise: Twice as many a's as b's | Automata Construction Exercise | User creates a Pushdowns Automata that accepts the langugage of strings that have twice as many a's as b's. | OpenDSA | Pushdown Automata |
| 150 | PDA Exercise: Equal a's to b's or c's | Automata Construction Exercise | User creates a Pushdowns Automata that accepts the langugage of a's b's and c's with as many a's as either... | OpenDSA | Pushdown Automata |
| 151 | PDA Exercise: Equal a's and b's | Automata Construction Exercise | User creates a Pushdowns Automata that accepts the langugage a^ic^jb^i. | OpenDSA | Pushdown Automata |
| 152 | PDA Exercise: String and Reverse | Automata Construction Exercise | User creates a Pushdowns Automata that accepts the langugage WcW^R. | OpenDSA | Pushdown Automata |
| 153 | Visualizaiton of the Turing Machine that accepts a^n b^n c^n | Algorithm Visualization, Code Tracing Presentation | Detailed trace on some examples for a Turing machine that accepts the langugage a^n b^n c^n. | OpenDSA | Turing Machine |