Problem 2

Give the state diagrams of DFAs for the following languages. In all parts sigma = {0, 1}. {w | w contains the substring 0101} {w | w does not contains the substring 110} {w | every odd position of w is 1} {w | w has an even number of 0s or exactly two 1s} {w | w has an even length and an odd number of 1s} Give the state diagrams of NFA with specified number of states for the following languages. The language of Problem 1.1 with five states. The language of Problem 1.4 with six states