Question & Answer: Give the state diagrams of DFAs for the following languages. In all parts sigma = {0, 1}. 1. {omega|omega conta…..

Give the state diagrams of DFAs for the following languages. In all parts sigma = {0, 1}. 1. {omega|omega contains the substring 0101} 2. {omega|omega does not contains the substring 110} 3. {omega|every odd position of omega is 1} 4. {omega|omega has an even number of 0s or exactly two 1s} 5. {omega|omega 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. 1. The language of Problem 1.1 with five states. 2. The language of Problem 1.4 with six states.