Let sigma 0 1 Construct a regular expression that describes

Let sigma = {0, 1}. Construct a regular expression that describes the language L = {01^n; w|n mod 3 = 0 and w sigma *}.

Solution

Regular expression for the given languagae is

0(111)* (0+1)* will accept all the strings starting with 0 along with number of consecutive 1\'s will be divisible by 3 and end with any combination of 0, 1.