**PLEASE ANSWER 1.1, 1.5, 1.6 and Q2 in the pictures below. **

**********PLEASE ANSWER 1.1, 1.5, 1.6 and Q2 in the pictures below.

Int troduction-To-The-Theory-Of-Computation-Michael-Sipserpdf - Adobe Acrobat Reader DC File Edit View Window Help - ax Home Tools Introduction-To-Th.. . O Sign in e A 8 a 0 0 1 as 1 as M O news - R & D R 0 1 EXERCISES 83 A S Export PDF EXERCISES Create PDF Y 1.1 The following are the state diagrams of two DFAs, M, a and MS2. Answer the follow ing questions about each of these machines. Edit PDF OF 0 Comment Combine Files 1 2 2 ED Organize Pages v ab as a l Fill & Sign the Send for Signature M. M1, - Send & Track O More Tools a. What is the start state? b. What is the set of accept states? C. What sequence of states does the machine go through on input aabb? d. Does the machine accept the string aabd? e. Does the machine accept the string e? 1.2 Give the formal description of the machines M; and My pictured in Exercise 1.. 1.3 The formal description of a DFAM is so... . . .O: 1. Su.d. S..so Store and share files in the Document Cloud Learn More Type here to search 8:59 PM 9/26/2017