2b Type 2 Substring Problems
2b Type 2 Substring Problems
Obtain a DFA to accept strings of a’s and b’s having a substring aa
More Videos on
DFA Design in Theory of Computation (TOC)
1a. Type 1: Ending with Problems: Ending with single string:
Construct a minimised DFA for accepting strings ending with 100 over alphabet {0,1}
• 1a. Type 1 Ending with Problems Ending wit...
1b. Type 1: Ending with Problems: Ending with single string:
Design a DFA to accept all strings that end with ‘abb' over the alphabet {a,b}.
• 1b Type 1 Ending with Problems Ending with...
1c. Type 1: Ending with Problems: Ending with string 1 OR string 2:
Design a DFA to accept binary strings ending with 100 or 101 over the alphabet {0,1}
• 1c Type 1 Ending with Problems Ending with...
1d. Type 1: Ending with Problems: Ending with string 1 OR string 2:
Design a DFA to accept binary strings ending with aaa or aab over the alphabet {a,b}
• 1d Type 1 Ending with Problems Ending with...
2a. Type 2: Substring Problems:
Construct a DFA accepting the strings containing 010 as a substring over {0, 1}
• 2a. Type 2 Substring Problems
2b. Type 2: Substring Problems:
Obtain a DFA to accept strings of a’s and b’s having a substring aa
• 2b Type 2 Substring Problems
3a. Type 3: Starting with Problems:
Design a DFA to accept binary strings starting with 110 over the alphabet {0, 1}
• 3a. Type 3 Starting with Problems
3b. Type 3: Starting with Problems:
Design a DFA to accept binary strings starting with ab over the alphabet {a, b}
• 3b. Type 3 Starting with Problems
4a. Type 4: Worded Problems:
Design a DFA that contains strings in which leftmost symbol differ from the rightmost symbol. Σ is given by {0, 1}.
• 4a. Type 4 Worded Problems
4b. Type 4: Worded Problems:
Design a DFA for set of all strings over {0, 1} such that the third symbol from the right end is 1.
• 4b. Type 4 Worded Problems
5a. Type 5: Divisibility Problems: Divisibility for binary numbers:
Design an FSM that accepts all the strings divisible by three over a binary number.
• 5a. Type 5 Divisibility Problems- Divisibi...
5b. Type 5: Divisibility Problems: Divisibility for unary numbers:
Design an FSM that accepts all the strings divisible by three over a unary number.
• 5b. Type 5 Divisibility Problems- Divisibi...
5c. Type 5: Divisibility Problems: Divisibility for ternary numbers:
Design a DFA which can accept a ternary number divisible by 4.
• 5c. Type 5 Divisibility Problems- Divisibi...
5d. Type 5: Divisibility Problems: Divisibility for decimal numbers:
Design a DFA that can accept a decimal number divisible by 3
• 5d. Type 5 Divisibility Problems- Divisibi...
6. DFA Minimization using Equivalence Theorem:
Construct the minimum state DFA equivalent to the given DFA
• 6. DFA Minimization using Equivalence Theorem
7a. NFA to DFA Conversion:
Convert the following NFA to equivalent DFA
• 7a. NFA to DFA Conversion
7b. NFA to DFA Conversion:
Convert the following NFA to equivalent DFA
• 7b. NFA to DFA Conversion
8a. NFA with ε to DFA Conversion
Find the ε-closure for the states in the given NFA-ε
• 8a. NFA with ε to DFA Conversion
8b. NFA with ε to DFA Conversion
Convert the following NFA-ε to DFA
• 8b. NFA with ε to DFA Conversion