Unformatted text preview: < bitstring > mod 7 = 0. 4. The set of all strings beginning with a 1 which, interpreted as the binary representation of an integer, are greater than 999. Problem 2 – NFA and DFA 1. Construct a nondeterministic ﬁnite automaton (NFA) for the regular expression ( ab * c ) | d using Thompson’s Construction Algorithm. 2. Convert your NFA with ± transitions into a DFA using the subset construction. 3. Show that your DFA is minimal or, if it is not minimal, give the minimal DFA....
View Full Document
- Spring '10
- Natural number, binary representation