Module 18 Worksheet
In Class Questions
1) (S7) For an FSA M, is it possible for a configuration (q, x) to yield more than one
configuration in three steps?
How about for an NFA M?
2) (S8) How do you think we will define L(M) for an NFA M?
3) (S8) How do you think we will define whether or not a language L is in LNFA?
Take home review questions
1) Which of the 5 attributes, Q, , q0, , or A, is different in an NFA than in an FSA, and
how is it different?
2) What must be true in order for a string x to be in L(M) for an NFA M?
3) Draw the computation graphs of the following NFA on the input strings abab and
baba.
a,b
I
a
b
II
III