Course Name: Theory of Automata Requirement: Plz don't copy answer from google Q . Construct a regular expression defining each of the following languages over the alphabet I = {a, b} i) All words...

Course Name: Theory of Automata

Requirement:  Plz don't copy answer from google

Q. Construct a regular expression defining each of the following languages
over the alphabet I = {a, b}

       i)  All words that contain exactly three b's in total.

       ii) All words that contain exactly two b's or exactly three b's, not more.