H Let E= {0, 1}. Let L be the language consisting of the set of all...

 

Transcribed Image Text:

H Let E= {0, 1}. Let L₁ be the language consisting of the set of all strings over E that that start with 0 and contain the substring 11. (Note that 0 and 11 are not in L. The string 011 and the string 0110 are two examples of strings that are in L.) (a) Give a DFA (deterministic finite automaton) that accepts the language L₁. (b) What is 8(90, 0110) for your DFA in part (a), where qo is your initial state and is the transition function for your DFA? H Let E= {0, 1}. Let L₁ be the language consisting of the set of all strings over E that that start with 0 and contain the substring 11. (Note that 0 and 11 are not in L. The string 011 and the string 0110 are two examples of strings that are in L.) (a) Give a DFA (deterministic finite automaton) that accepts the language L₁. (b) What is 8(90, 0110) for your DFA in part (a), where qo is your initial state and is the transition function for your DFA?