Showing 0-0 of 0 results
# Exercise Title Features Description Platform Keywords
1 Regular Expression Exercise: Strings Containing aba RegEx Writing Exercise User writes an regular expression for the language of strings containing aba. OpenDSA Regular Expression
2 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
3 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
4 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
5 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
6 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
7 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
8 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
9 Regular Expressions Introduction Frameset Programmed Instruction Programmed Instruction Frameset introducing Regular Expressions their formal definition. OpenDSA Regular Expression
10 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
11 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
12 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
13 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
14 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
15 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
16 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
17 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
18 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
19 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
20 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
21 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