What is the definition of a language?
Draw a diagram of a finite state machine that accepts (answers yes on) all strings of a's and b's that have at least two a's and exactly one b, and rejects all other strings.
Give a regular expression that describes the set of strings from the preceding problem.
Give one member and one nonmember of the language described by regular expression a*b(a+b)*, where + is the union operator and the alphabet is {a,b}.
Suppose that the following NFA is converted to a DFA by the subset construction. Draw a diagram of the resulting DFA. Label each state by the set to which it corresponds.
