Consider a language ‘L’ defined over ∑= {a, b, c} such that it contains all words in which ‘b’ occurs exactly once in a string.  a. Construc...

Provide the regular expression RE defined over ∑= {0,1} for the strings belonging to the following languages:  a.      All strings having ze...