Showing 0–0 of 0 results
# Exercise Title Features Description Platform Keywords
1 Programmed Instruction: Non-Deterministic Finite Automata Programmed Instruction Programmed Instruction Frameset introducing the concept of non-determinism and the NFA. OpenDSA Deterministic Finite Automata
2 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
3 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
4 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
5 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
6 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
7 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
8 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
9 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
10 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
11 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
12 DFA Exercise: Even Binary Numbers Automata Construction Exercise User creates a DFA that accepts the langugage of even binary numbers. OpenDSA Deterministic Finite Automata
13 DFA Exercise: Minimize the Number of State Exercise 1 Automata Construction Exercise User shows the steps in the algorithm to minimize the states in a given DFA. Exercise 1. OpenDSA Deterministic Finite Automata
14 DFA Exercise: Minimize the Number of State Exercise 2 Automata Construction Exercise User shows the steps in the algorithm to minimize the states in a given DFA. Exercise 2. OpenDSA Deterministic Finite Automata
15 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
16 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
17 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
18 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
19 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
20 NFA Construction Exercise 1 Automata Construction Exercise Construct an NFA: Exercise 1 OpenDSA Deterministic Finite Automata
21 Convert NFA to DFA Exercise 1 Automata Construction Exercise User shows the steps to convert a given NFA to an equivalent DFA: Exercise 1 OpenDSA Deterministic Finite Automata
22 Programmed Instruction: DFA Advanced Concepts Programmed Instruction Programmed Instruction Frameset covering more advanced DFA concepts. OpenDSA Deterministic Finite Automata
23 Programmed Instruction: DFA Definitions Programmed Instruction Programmed Instruction Frameset covering the formal definition of a DFA. OpenDSA Deterministic Finite Automata
24 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
25 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
26 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
27 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
28 DFA Example Trace: How a DFA Traces Algorithm Visualization, Code Tracing Presentation Visualization of how a DFA would process an input string. OpenDSA Deterministic Finite Automata
29 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
30 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
31 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
32 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
33 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
34 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
35 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
36 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
37 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
38 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
39 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
40 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
41 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
42 Deterministic vs Nondeterministic PDAs Programmed Instruction Programmed Instruction Frameset discussing the differences between deterministic and non-deterministic PDAs. OpenDSA Pushdown Automata
43 Grammars for Deterministic CFL Programmed Instruction Programmed Instruction Frameset discussing grammars for deterministic context free languages. OpenDSA Context-Free Language
44 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