Question

9. [5 points] Design DFA to accept language L where all the strings in L are such that total number of a's in them are not divisible by 3. 10. [5 points] Draw DFA for accepting strings: a. The string in \{0,1\}$^$ starts in 10 or 11. b. The string in \{0,1\}$^$ ending in 0 and not containing substring 11.

          9. [5 points] Design DFA to accept language L where all the strings in L are such that total
number of a's in them are not divisible by 3.
10. [5 points] Draw DFA for accepting strings:
a. The string in \{0,1\}$^*$ starts in 10 or 11.
b. The string in \{0,1\}$^*$ ending in 0 and not containing substring 11.

$9. [5 points] Design DFA to accept language L where all the strings in L are such that total number of a's in them are not divisible by 3. 10. [5 points] Draw DFA for accepting strings: a. The string in {0,1}^* starts in 10 or 11. b. The string in {0,1}^* ending in 0 and not containing substring 11.$

Added by John M.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Akash M

09/20/2023

Step 1

To design a DFA for this language, we need to consider the possible remainders when dividing the total number of a's by 3. There are three possible remainders: 0, 1, and 2. Show more…

Show all steps

Thanks for your feedback!

Please answer all parts of both questions below. Thank you in advance. 9. [5 points] Design DFA to accept language L where all the strings in L are such that tota number of a's in them are not divisible by 3 10.[5points] Draw DFA for accepting strings: a.The string in {0,1}'starts in 10or 11. b. The string in {0,1}ending in 0 and not containing substring 11