Automata Theory Computer Science

5. Give the state diagrams of DFAs recognizing the following languages over { = {0, 1}: a. Lo b. L C. {, 1, 001}