What is an alphabet, in general? What characteristics must it have?
What is the definition of a language? That is, what is a language in general (as opposed to the definition of a particular language).
Does there exist a language that can be described (or recognized) by a generalized finite state machine, but that cannot be described (or recognized) by a deterministic finite state machine?
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.
