Assignment No. 2:

(1) Draw a finite state automaton that generates any valid 
    telephone number found in the U.S. (e.g., 7, 10, and 11 digits
    with suitable constraints on area codes and exchanges.

(2) Draw all finite state automata that are used for 
    word models in our baseline TIDigits system.
    Are these deterministic?

(3) Repeat (2) for our monphone models in our
    baseline monophone recognition system.
    Are these deterministic?

(4) Draw a nondeterministic finite state automaton (FSA)
    that contains at least 3 nodes and 3 vertices.
    Convert it to a deterministic FSA.

(5) Describe what type of language is represented in our
    XML and JSGF grammar formats. Explain.

This assignment is due by 8 AM on Monday, Sept. 12.