Decide whether each of the following statements is true or false.

Use Thompson's algorithm exactly as defined in the lecture notes to construct an NFA from the regular expression

Use Thompson's algorithm exactly as defined in the lecture notes to construct an NFA from the regular expression

Use Thompson's algorithm exactly as defined in the lecture notes to construct an NFA from the regular expression

Which of the following strings belong to the set denoted by the regular expression

Use the Subset construction, as defined in the lecture notes, to construct DFA from the NFA produced by Thompson's construction on the regular expression

Decide which of the following regular expressions are equivalent to the regular expression

Write out the 5 bit sign-magnitude representation of the decimal number -4. Your answer must be a string of five 0's and 1's with no spaces or

other characters.

Write out the 5 bit sign-magnitude representation of the decimal number 4. Your answer must be a string of five 0's and 1's with no spaces or

other characters.

In each case select the decimal number represented by the given binary representation.