Module 17 Worksheet
In Class Questions
1) (S7) Suppose the input to the construction algorithm was an FSA M represented as the
following string:
Q = {B, C, D, E, F}
Σ
= {a}
q
0
= {B}
A = {C, E}
δ
= {(B,a,C), (C,a,D), (D,a,E), (E,a,F), (F,a,F)}
What should the corresponding output look like?
2) (S7) Describe at a high level the major steps the construction algorithm would perform
in order to correctly compute M’ given an arbitrary input M in the above format.
3) (S10) Why in this case are we working with L
1
and L
2
whereas for set complement, we
only worked with L?
4) (S15) How many states are in Q
3
if Q
1
has 5 states and Q
2
has 13 states?
5) (S15) Let Q
1
and Q
2
be arbitrary FSA’s and Q
3
be the result of applying this
construction to Q
1
and Q
2
.
Suppose Q
3
is in the state (III, T) after processing the input
string aaba.
What states would Q
1
and Q
2
be in after processing input string aaba?
Q
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '07
 TORNG
 Set Theory, Naive set theory, Intersection, Symmetric difference

Click to edit the document details