(i) Define a language L, in a recursive way where the strings should not contain ab at any place over alphabet = {a, b}

(ii) Give a regular expression for the Language over the alphabet = {a, b} containing the count of bs are always multiple of 2.

(iii) Draw a DFA for the given transition table over alphabet {a,b}

(Note: Kindly answer the full question and also according to the given scenario. Most of the Chegg answers are not up to the mark and most experts are not experts at all. They just try to answer quickly without taking care of the quality.

If you don't have in-depth knowledge about the topic then don't answer it.)

i. Define a language L, in a recursive way where the strings should not contain ab at any place over alphabet ? = {a, b} (3) Give a regular expression for the Language over the alphabet [ = {a, b} containing the count of b's are always multiple of 2. ii. (3) iii. Draw a DFA for the given transition table over alphabet {a,b} (3) Input State a b Q1 Q1 Q2 Q3 Q2 Q3 Q2