Subject: Theory of computation

1. Construct a DFA which accepts the language of all binary strings where every odd position is 1. [2 pts] 2. Construct a DFA which accepts the language of all binary strings that have at least three symbols and whose first and last symbols are different. [2 pts] 1. Construct a NFA which accepts the language L of all strings over {a,b} defined by L = {bambk 0 sn S1, m > 0, k > 0}. (2 pts] 2. Construct a NFA which accepts the language L of the English alphabet defined by L = {read, listen, study, succceed}. [2 pts]