indicate whether or not the following NFA accepts the given strings

	A	B
1	1	3,4
2	2	1	4
3	3	4
4	3	1

String : AAAAA

BBBBB

BBABA

AABB

BABAB

ABBB

what are the accepts and fails ?

Accepts	Fails

minimize the following DFA, draw the minimized version

	A	B
M	Q	S
N	M	N
P	T	P
Q	T	N
R	P	N
S	Q	S
T	P	T

the first table on the first question is the nfa that the strings relate to. based on the table and the strings, you should be able to tell whether the nfa accepts or rejects them(fails)

the second question asks to minimize the table into a dfa diagram, eliminating the states that are the same. (same inputs or same outputs)