Example: Let L = {PE {0, 1)" : r- {0, 1)" st. I = 3} That is, L consists of all strings with at least 4 symbols, where the 4th symbol from the end is 1. ylz, for some y, z E The smallest DFA that accepts L has 16 states. - There's an NFA with 5 state which accepts L