Tutorial1 DFA
Uploaded by
Akshat GuptaTutorial1 DFA
Uploaded by
Akshat GuptaTutorial 1 (DFA)
1. Construct a DFA that accepts any string over ∑={a,b} that contains at least two a’s.
2. Construct a DFA that accepts any string over ∑={a,b} that contains exactly two a’s.
3. Construct a DFA that accepts any string over ∑={a,b} that contains at most two a’s.
4. Construct a DFA that accepts any string over ∑={a,b} that contains at least two a’s and exactly one b.
5. Construct a DFA that accepts any string over ∑={a,b} that contains at least two a’s and at most 2 b’s.
6. Construct a DFA that accepts any string over ∑={a,b} that contains even number of a’s.
7. Construct a DFA that accepts any string over ∑={a,b} in which starting and last symbol should be
similar.
8. Construct a DFA that accepts any string over ∑={a,b} in which starting and last symbol should be
different.
9. Construct a DFA that accepts any string over ∑={a,b} in which second last symbol should be a, and
string W>=2.
10. Construct a DFA for the language accepting strings ending with ‘abb’ over input alphabets ∑ = {a, b}
11. Construct a DFA for the language accepting strings ending with ’01’ over input alphabets ∑ = {0, 1}
12. Construct a DFA for the language accepting strings ending with ‘abba’ over input alphabets ∑ = {a, b}
13. Construct a DFA for the language accepting strings ending with ‘0011’ over input alphabets ∑ = {0, 1}
14. Construct a DFA with ∑ = {0, 1} accepts those string which starts with 1 and ends with 0.
15. Construct a DFA with ∑ = {0, 1} accepts the set of all strings with three consecutive 0's.
