CS150 HW1
Set April 6
Due April 15 (at 3pm)
Total: 65 pts + 5 bonus pts
Q1 [10 pts] Give DFA's accepting the following languages
over the alphabet {0,1}:
a) The set of all strings that contain three consecutive 1's.
b) The set of all strings that contain 100 as a substring.
Q2 [10 pts] Give a DFA accepting the following languages
over the alphabet {0,1}: the set of all strings that either
begin or end with 10 (or both).
Q3 [20 pts] P. 54 of HMU (same in 2nd edition) Ex.2.2.8.
Let A be a DFA and a particular input symbol of A, ...
Please be careful with the page and exercise numbers if you are using
an international edition of the book!!!
Q4 [15 pts + 5 bonus pts] Design an NFA (or e-NFA) for each of the languages
in P. 53 of HMU (or P. 54 in 2nd edition), Ex.2.2.5 b), c) and d).
The NFA for the language in part a) is optional and worth 5 bonus points.
Note that a DFA is also an NFA by definition.
Q5 [10 pts] P. 66 of HMU (same in 2nd edition) Ex.2.3.2.
Convert to a DFA the following NFA: ...