210k views
2 votes
1. Give state diagrams of DFAs recognizing the following languages. The alphabet is {0, 1}. (a) w is any string except 11 and 111 (b) w

1 Answer

6 votes

Answer:

Step-by-step explanation:

The first diagram shows the DFA that accepts that accepts any string except 11 and 111

The second diagram shows every odd position of w is 1

1. Give state diagrams of DFAs recognizing the following languages. The alphabet is-example-1
1. Give state diagrams of DFAs recognizing the following languages. The alphabet is-example-2
User Anatolii Kosorukov
by
4.2k points