F 15. A configuration of a DFSM M is an element of the cross pro is the set of states in M, and 2 is the alphabet of L(M). 16. -(a, b), L- (W: w contains bba as a substring that starts at an even numbered position in w, where numbering starts at o w c L iff it matches the regular expression: (a'b')'a T F 17. L- 2a,b), L (w : every a in w is immediately preceded and followed by b w e L iff it matches the regular expression: ((a ub) (aub))' bba (a u b) 18. In a pumping theorem proof, you must show that for some value of y, and for all F F 19. In a pumping theorem proof, it is possible that xz . T F 20. In a pumping theorem proof, there is a unique set of equivalence classes for every possible value of y. That is, there is always just one way to partition the y- space into cases that must be considered in the proof