,
, 
, and 
,
where the initial state is 1.
[25]April 7, 1998
1. Find a regular expression R(1,2,2) for the NFA given by ,
, , and ,
where the initial state is 1.
[25]
2. Let S and T be sets of state of an 
. Prove by Structural Induction
that if 
, then 
. [25]
3. From the simplest NFAs construct that accepts the language represented by
using union, concatenation, and Kleene star operations on NFAs
DO NOT SKIP STEPS. DO NOT SIMPLIFY. [25]
4. Find a FA equivalent to the following NFA: [25]