CS385-Theory of Computation
First Test
October 16, 2006
1. Consider the NFA
M = (cfw_0, 1, 2, cfw_a, b, , 0, cfw_2)
dened by
(0, a) = cfw_0, 1, (0, b) = cfw_0, (1, b) = cfw_2,
and
(q, ) =
for all pairs (q, ) not explicitly listed above.
(a) Draw the st
Test
CS385-Theory of Computation
October 23, 2007
1
Consider the language L1 generated by the regular expression
a(a b) b b(a b) a.
(a) For each of the following four strings, tell whether or not the string is an element of
L1 :
ab, aba, baa, baabb.
(b) D
Test 2
CS385-Theory of Computation
November 15, 2007
There are two problems on this test, each with several partsa nite automaton problem and a context-free language problem. The usual rules applyyou should show all your
work carefully, and justify any cl