Showing 0-0 of 0 results
# Exercise Title Features Description Platform Keywords
1 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
2 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
3 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
4 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
5 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
6 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
7 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
8 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
9 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
10 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
11 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
12 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
13 Programmed Instruction: Non-Deterministic Finite Automata Programmed Instruction Programmed Instruction Frameset introducing the concept of non-determinism and the NFA. OpenDSA Deterministic Finite Automata