CSC420 Computing Theory

Consider the following DFA over ={a,b} : - DFAI recognizes language LI=L(MI) DFA1 M1 for Ll a) Construct a DFA for the language L1*. b) What is the regular expression (RE) for L1? a) Consider the following NFA- over ={a,b} : Convert this NFA-e into DFA. Answer: b) Build NFA for L((ba)(ab)) over ={a,b}