Showing 0–0 of 0 results
# Exercise Title Features Description Platform Keywords
1 DFA Exercise: Length a Multiple of 3 with No aab Automata Construction Exercise User creates a DFA that recognizes strings with length a multiple of 3 and containing no instance of aab. OpenDSA Context-Free Grammar
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 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
23 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
24 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
25 PDA Exercise: String and Reverse Automata Construction Exercise User creates a Pushdowns Automata that accepts the langugage WcW^R. OpenDSA Pushdown Automata
26 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
27 Turing Machine Exercise: Reverse a String Automata Construction Exercise User creates a Turing machine that, given string W, outputs WW^R. OpenDSA Turing Machine
28 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
29 Turing Machine Exercise: Add an a Automata Construction Exercise User creates a Turing machine that adds an a to a string of a's. OpenDSA Turing Machine
30 Turing Machine Exercise: Accept Powers of 2 Automata Construction Exercise User creates a Turing machine that accepts strings of a's with the number of characters being a power of 2. OpenDSA Turing Machine
31 Turing Machine Exercise: Erase abc Automata Construction Exercise User creates a Turing machine that erases a string of a's, b's, and c's. OpenDSA Turing Machine
32 Turing Machine Exercise: Decide Powers of 2 Automata Construction Exercise User creates a Turing machine that decides if strings of a's have a length that is a power of 2. OpenDSA Turing Machine
33 Turing Machine Exercise: Keep abc Automata Construction Exercise User creates a Turing machine that moves over a string of a's, b's, and c's. OpenDSA Turing Machine
34 Turing Machine Exercise: Replace aba with aca Automata Construction Exercise User creates a Turing machine that replaces every substring aba with aca. OpenDSA Turing Machine