Question

How do you construct a DFA for the regular expression aa*bb* ?

Answer 1

Answer:

महाकाल बाबा से डरो थोड़ा नुबडे

Answer 2

Explanation:

Before you go through this article, make sure that you have gone through the previous article on Type-01 Problems.

Type-02 Problems-

In Type-02 problems, we will discuss the construction of DFA for languages consisting of strings starting with a particular substring.

Steps To Construct DFA-

Following steps are followed to construct a DFA for Type-02 problems-

Step-01:

Determine the minimum number of states required in the DFA.

Draw those states.

Use the following rule to determine the minimum number of states-