Design DFA and write down Regular Expression for the following langua…

Question

Design DFA and write down Regular Expression for the following language over \{ a, b \}:

(a) All strings having at least three a's and at least two b's.

(b) All strings having substring bbb.

(c) All strings not having substring aab.

(d) All strings having length at most 5.

(e) All strings having even number of a's and even number of b's.

Related pages

• Designing DFA — topic
• Theory of Computation syllabus