course csc520 (theory of computing) in need everything in details pls ,so I can understand,.

it's a csc520 course ,title theory of computing . easy for you to understand better.

W L1 - Word - OX L1 = {w: w = a'b'} and L2 = {w: w = abn}. L1 RLs, and L2 RLS.IRLsI=Xo HW #1A: Submit a diagram that is easy to interpret, and do not forget to include an honor code affirmation OSI WD Page 1 of 1 42 words SO ' & + 100% OS 1.a.1 (10 points) Complete the diagram of Mo to show a DFSM converted from MNO Include a dead state if needed. Remember that C-transitions, and multiple transitions on the same input symbol, are not allowed in a DFSM, and that the states in a converted DFSM are labeled with the set of states the NDFSM could be in after reading the same input. Your diagram must be easy to in be graded. 040-00 MC- complete the diagram of a DFSM converted from