EECS 2001 Final: assignment1

• School: York University
• Department: Electrical Engineering and Computer Science
• Course: EECS 2001
• Professor: Eric Ruppert

Document Summary

Notes: assignments must be deposited in the eecs 2001 drop box before 6pm, assignments must have eecs 2001 cover page clearly indicating: your full name, student number, the course name, and this assignment"s number (nr 1). Justify your answer for cases (b) and (c). A1 = {if, then, else, =, x, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, (, )} Let a be an alphabet, a be one of its elements, and let l, l1, l2 be languages over a. By a(ev) let us denote the set of all strings from a of even length. Let m =< q, , , q0, f > be the dfa de ned as follows: = {a, b}, q = {q0, q1, q2, q3}, f = {q3}. (q0, w). (1) abaa (2) aaaabb (c) which of the strings from (b) are accepted by m? (d) describe formally l(m ) as.